import os
import sys
import heapq

N, M = map(int, input().split(' '))
e={}
for i in range(N):
    for j in range(N):
        e[(i,j)] = sys.maxsize

for i in range(M):
    v1, v2, cost = [int(x) for x in input().split(' ')]
    e[(v1 -1, v2 -1)] = cost
    e[(v2 -1, v1 -1)] = cost

d = [sys.maxsize] * N
d_exe = [sys.maxsize] * N
d[0] = 0
d_exe[0] = 0
h = []
for i in range(N):
    heapq.heappush(h, (d[i],i))
while len(h) > 0:
    p = heapq.heappop(h)
    for idx, (_, i) in enumerate(h):
        if e[(p[1], i)] < sys.maxsize:
            alt = p[0] + e[(p[1], i)]
            if d[i] < alt : continue
            d[i] = alt
            h[idx] = (alt, i)
    heapq.heapify(h)

h = []    
for i in range(N):
    heapq.heappush(h, (d_exe[i],i))
while len(h) > 0:
    p = heapq.heappop(h)
    for idx, (_, i) in enumerate(h):
        if e[(p[1], i)] < sys.maxsize:
            alt = min(p[0] + e[(p[1], i)], d[p[1]])
            if d_exe[i] < alt : continue
            d_exe[i] = alt
            h[idx] = (alt, i)
    heapq.heapify(h)

for i in range(N):
    print(d[i] + d_exe[i])