#!/usr/bin/env python3
# %%
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from heapq import heappop, heappush

# %%
N, M = map(int, readline().split())
m = map(int, read().split())
ABC = zip(m, m, m)


# %%
G = [[] for _ in range(N + N + 1)]
for a, b, c in ABC:
    G[a].append((b, c))
    G[a].append((b + N, 0))
    G[a + N].append((b + N, c))
    G[b].append((a, c))
    G[b].append((a + N, 0))
    G[b + N].append((a + N, c))


# %%
INF = 10**18
dist = [INF] * (N + N + 1)
q = [1]
dist[1] = 0
while q:
    x = heappop(q)
    dv, v = divmod(x, 1 << 20)
    if dist[v] > dv:
        continue
    for w, c in G[v]:
        dw = dv + c
        if dw >= dist[w]:
            continue
        dist[w] = dw
        heappush(q, (dw << 20) + w)


# %%
dist[1 + N] = 0
answer = (x + y for x, y in zip(dist[1:], dist[1 + N:]))
print('\n'.join(map(str, answer)))