Task: Text Simplification
Input (English): There may be several minimum spanning trees of the same weight ; in particular , if all the edge weights of a given graph are the same , then every spanning tree of that graph is minimum .
Output (English): In a graph where all the edges have the same weight , every tree is a minimum spanning tree .