68. Suppose G is a graph such that all the weights on its edges are different numbers. Show that there is a unique minimum-cost spanning tree.