最小生成树

def solve(edges):
    edges_list = []
    for e in edges.split(';'):
        u, v, w = map(int, e.split(','))
        edges_list.append((w, u, v))
    edges_list.sort()
    parent = {}
    def find(x):
        if x not in parent:
            parent[x] = x
        if parent[x] != x:
            parent[x] = find(parent[x])
        return parent[x]
    total = 0
    for w, u, v in edges_list:
        pu, pv = find(u), find(v)
        if pu != pv:
            parent[pu] = pv
            total += w
    print(total)