最小生成树经典

def solve(____):
    edges_list = [list(map(int, e.split(____))) for e in str(____).split(____)]
    edges_list.sort(____)
    parent = list(range(____))
    def find(____):
        while parent[x] != x:
            parent[x] = parent[parent[x]]
            x = parent[x]
        return x
    def union(____):
        pa, pb = find(____), find(____)
        if pa == pb:
            return False
        parent[pa] = pb
        return True
    total = ____
    cnt = ____
    for u, v, w in edges_list:
        if union(____):
            total += w
            cnt += ____
            if cnt == n - ____:
                break
    print(____)