from heapq import heappop, heappush

INF = 1 << 60


def dijkstra(s, edge):
    n = len(edge)
    dist = [INF] * n
    dist[s] = 0
    hq = []
    heappush(hq, (dist[s], s))

    while hq:
        dist_v, v = heappop(hq)
        if dist_v > dist[v]:
            continue
        for cost, nx in edge[v]:
            if dist[nx] > dist[v] + cost:
                dist[nx] = dist[v] + cost
                heappush(hq, (dist[nx], nx))
    return dist


N, M = map(int, input().split())
G = [[] for _ in range(2 * N)]

for _ in range(M):
    a, b, c = map(int, input().split())
    a -= 1
    b -= 1
    G[a].append((c, b))
    G[b].append((c, a))
    G[a].append((0, b + N))
    G[b].append((0, a + N))
    G[a + N].append((c, b + N))
    G[b + N].append((c, a + N))

for i in range(N):
    G[i].append((0, i + N))

dist = dijkstra(0, G)

for i in range(N):
    ans = dist[i] + dist[i + N]
    print(ans)