We all know that:
Every graph has an MST. The MST need not be unique, but it is unique if all the edge weights of the graph are distinct.
But if the weights of the edges in a connected graph are not all distinct, does it mean that there is more than one minimum spanning tree?