N,M = map(int,input().split())
ABC = [list(map(int,input().split())) for _ in range(M)]
E = [[] for _ in range(N)]
for a,b,c in ABC:
    E[a-1].append([b-1,c])
    E[b-1].append([a-1,c])
import heapq
D = [float('inf')] * N
D2 = [float('inf')] * N

#普通のダイクストラ
def dijkstra():
    D[0] = 0
    q = []
    heapq.heappush(q, [0, 0])
    while len(q) > 0:
        # ヒープから取り出し
        _, u = heapq.heappop(q)
        for i in E[u]:
            a,b = i
            if D[a] > D[u] + b:
                # 頂点までのコストが更新できれば更新してヒープに登録
                D[a] = D[u] + b
                heapq.heappush(q, [D[a], a])
    return D

#コスト－最大値の最小を取っていくダイクストラ
def dijkstra2():
    D2[0] = 0
    q = []
    heapq.heappush(q, [0, 0]) #コスト、頂点
    while len(q) > 0:
        # ヒープから取り出し
        _, u = heapq.heappop(q)
        for i in E[u]:
            a,b = i
            tmp = min(D[u],D2[u] + b)
            if D2[a] > tmp:
                D2[a] = tmp
                heapq.heappush(q, [D2[a], a])

    return D2

dijkstra()
dijkstra2()
ans = [0] * N
for i in range(N):
    print(D[i] + D2[i])