Shortest Routes I

import math
from collections import deque

n, m = [int(x) for x in input().split()]
routes = []
for _ in range(m):
    routes.append([int(x) for x in input().split()])
processed = [False for _ in range(n)]
distance = [math.inf for _ in range(n)]
adj = [[] for _ in range(m)]

for i in range(len(routes)):
    route = routes[i]
    adj[route[0] - 1].append(route[1:])

q = deque()
distance[0] = 0
q.append([0, 0])
# print("Routes", routes)
while len(q) != 0:
    a = q.popleft()[1]
    if processed[a]: continue
    processed[a] = True
    for route in adj[a]: 
        b, w = route
        b -= 1
        if distance[a]+w < distance[b]:
            distance[b] = distance[a]+w
            q.append([-distance[b], b])   

print(*distance)

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: ACCEPTED

Test 12

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "input/code.py", line 24, in <module>
    for route in adj[a]:
IndexError: list index out of range

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: WRONG ANSWER

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED