import sys
readline = sys.stdin.readline
from heapq import heappush, heappop
inf = float('inf')


def dijkstra(s, g, N):
    # ゴールがない場合はg=-1とする。

    def cost(v, m):
        return v * N + m

    dist = [inf] * N
    mindist = [inf] * N
    seen = [False] * N
    Q = [cost(0, s)]
    while Q:
        c, m = divmod(heappop(Q), N)
        if seen[m]:
            continue
        seen[m] = True
        dist[m] = c
        if m == g:
            return dist

        #------heapをアップデートする。--------
        for u, C in G[m]:
            if seen[u]:
                continue
            newdist = dist[m] + C

            #------------------------------------
            if newdist >= mindist[u]:
                continue
            mindist[u] = newdist
            heappush(Q, cost(newdist, u))
    return dist

N, M = map(int, readline().split())
G = [[] for i in range(2 * N)]
for i in range(M):
    a, b, c, = map(int, readline().split())
    a, b = a - 1, b - 1
    G[a].append((b, c))
    G[b].append((a, c))
    G[a + N].append((b + N, c))
    G[b + N].append((a + N, c))
    G[a].append((b + N, 0))
    G[b].append((a + N, 0))
    
D = dijkstra(0, -1, 2 * N)
for i in range(N):
    print(D[i] + min(D[i], D[i + N]))