Let G be a complete undirected graph on 4 vertices, having 6 edges with weights being 1, 2, 3, 4, 5, and 6. The maximum possible weight that a Maximum weight spanning tree of G can have is. ?

For minimum weight spanning tree answer is 7 but I have to calculate it for maximum weight spanning tree.

How to solve it and what will be the answer.