A spanning tree is defined as a subgraph that includes all vertices of the original graph and is also a tree. For a graph with $n$ vertices, how many edges must any spanning tree possess?