Spanning trees on disconnected graphs
A spanning tree, by definition, has the same vertices as the graph it spans. Since such a tree is an induced subgraph and, since trees are (by definition) connected, the graph itself must be connected.

Note this applies to any spanning tree, not just a minimal one (i.e., an MST).