Prim最小生成树

def solve(____):
    from collections import defaultdict
    import heapq
    n = int(____)
    graph = defaultdict(____)
    for e in edges.split(____):
        u, v, w = map(int, e.split(____))
        graph[u].append((____))
        graph[v].append((____))
    visited = [False] * n
    pq = [(____, ____)]
    total = ____
    while pq:
        w, u = heapq.heappop(____)
        if visited[u]:
            continue
        visited[u] = True
        total += w
        for v, weight in graph[u]:
            if not visited[v]:
                heapq.heappush(pq, (____))
    print(____)