Subtour elimination constraints imply a matrix-tree theorem SDP constraint for the TSP

De Klerk et al., (2008) give a semidefinite programming constraint for the Traveling Salesman Problem (TSP) based on the matrix-tree theorem. This constraint says that the aggregate weight of all spanning trees in a solution to a TSP relaxation is at least that of a cycle graph. In this note, we show that the semidefinite constraint holds for any weighted 2-edge-connected graph and, in particular, is implied by the subtour elimination constraints.