We discuss some old and new results on the following problem. Given a graph with independent uniform [0,1] random edge weights, what can we say about the length of the minimum spanning tree.