import heapq

n,m=map(int,input().split())
v=[[] for i in range(n)]
for i in range(m):
    a,b,c=map(int,input().split());a-=1;b-=1
    v[a].append((b,c));v[b].append((a,c))
dist=[[1<<60]*2 for i in range(n)]
print(0)
hq=[];heapq.heappush(hq,(0,0,0))
while hq:
    a,b,c=heapq.heappop(hq)
    if dist[b][c]<a:
        continue
    for i,j in v[b]:
        if dist[i][c]>a+j:
            dist[i][c]=a+j
            heapq.heappush(hq,(a+j,i,c))
        if not c and a<dist[i][1]:
            dist[i][1]=a
            heapq.heappush(hq,(a,i,1))
for i in range(1,n):
    print(dist[i][0]+dist[i][1])