MST Weight (Kruskal)

Given a connected weighted undirected graph, print the total weight of its minimum spanning tree.

1 <= n <= 10^5 n-1 <= m <= 2*10^5 1 <= w <= 10^9