On stability of spanning tree degree enumerators

We show that the spanning tree degree enumerator polynomial of a connected graph $G$ is a real stable polynomial if and only if $G$ is distance-hereditary.