Dijkstra最短路

def solve(____):
    from collections import defaultdict
    import heapq
    n = int(____)
    start = int(____)
    end = int(____)
    graph = defaultdict(____)
    for e in edges.split(____):
        u, v, w = map(int, e.split(____))
        graph[u].append((____))
        graph[v].append((____))
    dist = [float(____)] * n
    dist[start] = ____
    pq = [(____, start)]
    while pq:
        d, u = heapq.heappop(____)
        if d > dist[u]:
            continue
        for v, w in graph[u]:
            if dist[v] > dist[u] + w:
                dist[v] = dist[u] + w
                heapq.heappush(pq, (____))
    print(____)