Given n nodes labeled 0..n-1 and a list of weighted edges [u, v, w], return the total weight of a Minimum Spanning Tree using Kruskal's algorithm.