If a loopless weighted graph (G,W) has a unique edge of minimum weight-- that is, for -- show that any minimum cost spanning tree of G must contain .

I realize this is true, but I need to prove it. I used Kruskal's Algorithm to show that there is at least one minimal cost spanning tree that includes . I'm just stuck trying to think of how to prove that edge is in ANY minimal cost spanning tree.