from heapq import heappop, heappush
def solve() : 
    N, M = map(int, input().split())

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

    dist=[float('inf')]*(2*N)
    dist[0]=dist[N]=0

    pq = []
    heappush(pq, (0,0))
    heappush(pq, (0,N))
    while pq:
        d, cur = heappop(pq)
        if d > dist[cur]: continue

        for cost, to in edge[cur]:
            if dist[to]>d+cost : 
                dist[to]=d+cost
                heappush(pq, (d+cost,to))
    for i in range(N) :
        print(dist[i]+dist[i+N])
solve()