Original: Given a connected, undirected graph, a spanning tree of that graph is a subgraph that is a tree and connects all the vertices together. A single graph can have many different spanning trees.
Simplified: Depending on what the graph looks like, there may be more than one minimum spanning tree.