from heapq import heappop,heappush
import sys
input = sys.stdin.readline
N,M=map(int,input().split())
table=[[] for i in range(N)]
for i in range(M):
    a,b,c=map(int,input().split())
    a,b=a-1,b-1
    table[a].append((b,c))
    table[b].append((a,c))
H=[]
cost=[10**18]*N
cost[0]=0
H.append((0,0))
while H:
    pt,cos=heappop(H)
    if cost[pt]<cos:
        continue
    for y,c in table[pt]:
        if cost[y]>cost[pt]+c:
            cost[y]=cost[pt]+c
            heappush(H,(y,cost[y]))
dp=[10**19]*N
dp[0]=0
def f(x):
    if dp[x]!=10**19:
        return dp[x]
    for y,c in table[x]:
        dp[x]=min(dp[x],f(y)+c)
        dp[x]=min(dp[x],cost[y])
    return dp[x]
for i in range(N):
    f(i)
dp2=[10**19]*N
dp2[0]=0
for x in range(N):
    for y,c in table[x]:
        dp2[x]=min(dp2[x],f(y)+c)
        dp2[x]=min(dp2[x],cost[y])
for i in range(N):
    print(dp2[i]+cost[i])