T is a spanning tree on an undirected graph G

$=$

$($

V

$,$

$$E

$)$

$.$

$$Edge costs in G are NOT guaranteed to be unique. If every edge in T belongs to SOME minimum cost spanning trees in G

$,$

$$then T is itself a minimum cost spanning tree.