Minimum Spanning Tree (Kruskal)

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

1 <= n <= 10^4 1 <= m <= 10^5 1 <= w <= 10^6