import heapq
n,m=map(int,input().split())
g=[[] for _ in range(n)]
for _ in range(m):
    a,b,c=map(int,input().split())
    g[a-1].append((b-1,c))
    g[b-1].append((a-1,c))
q=[(0,0,0)]
visited=[[False]*2 for _ in range(n)]
visited[0][1]=True
dst=[[10**18]*2 for _ in range(n)]
dst[0][1]=0
while q:
    now_d,f,now_place=heapq.heappop(q)
    if visited[now_place][f]:
        continue
    dst[now_place][f]=now_d
    visited[now_place][f]=True
    for to_place,cost in g[now_place]:
        if visited[to_place][f]==False:
            heapq.heappush(q,(now_d+cost,f,to_place))
        if not f and visited[to_place][1]==False:
            heapq.heappush(q,(now_d,1,to_place))
for i in range(n):
    print(sum(dst[i]))