from collections import deque

N, M = map(int, input().split())
ABC = [list(map(int, input().split())) for _ in range(M)]

G = [[] for _ in range(N)]
for i in range(M):
    a, b, c = ABC[i]
    a -= 1
    b -= 1
    G[a].append([b, c])
    G[b].append([a, c])
    
dist = [[float('inf')]*2 for _ in range(N)]
dist[0][0] = 0
que = deque([(0, 0)])

while que:
    now, isused = que.popleft()
    for nxt, d in G[now]:
        if dist[nxt][isused] <= dist[now][isused]:
            continue
        if dist[nxt][isused] > dist[now][isused] + d:
            dist[nxt][isused] = dist[now][isused] + d
            que.append((nxt, isused))
        if isused == 0 and dist[nxt][1] > dist[now][0]:
            dist[nxt][1] = dist[now][0]        
            que.append((nxt, 1))

for i in range(N):
    if i == 0:
        print(0)
    else:
        print(sum(dist[i]))