Simplify the following text for a Grade 7 native English-speaking person.
Original: There may be several minimum spanning trees of the same weight having a minimum number of edges ; in particular , if all the edge weights of a given graph are the same , then every spanning tree of that graph is minimum . If there are n vertices in the graph , then each tree has n-1 edges .
Simplified: In a graph where all the edges have the same weight , every tree is a minimum spanning tree .