Kruskal最小生成树

def solve(____):
    n = int(____)
    edges_list = []
    for e in edges.split(____):
        u, v, w = map(int, e.split(____))
        edges_list.append((____))
    edges_list.sort()
    parent = list(range(____))
    def find(____):
        if parent[x] != x:
            parent[x] = find(____)
        return parent[x]
    total = ____
    for w, u, v in edges_list:
        pu, pv = find(____), find(____)
        if pu != pv:
            parent[pu] = pv
            total += w
    print(____)