import os
import sys
import heapq

def main():
    N, M = map(int, input().split(' '))
    e=[]
    for i in range(N):
        e.append([])
    for i in range(M):
        v1, v2, cost = [int(x) for x in input().split(' ')]
        e[v1-1].append((v2-1,cost))
        e[v2-1].append((v1-1,cost))

    d = [10**9 + 1] * N
    d_exe = [10**9 +1] * N
    d[0] = 0
    d_exe[0] = 0
    h = []
    heapq.heappush(h, (0,0))
    while len(h) > 0:
        p = heapq.heappop(h)
        if d[p[1]]<p[0]: continue
        for i,cost in e[p[1]]:
            alt = p[0] + cost
            if d[i] < alt : continue
            d[i] = alt
            heapq.heappush(h,(alt, i))


    h = []
    heapq.heappush(h, (0,0))
    while len(h) > 0:
        p = heapq.heappop(h)
        if d[p[1]]<p[0]: continue
        for i, cost in e[p[1]]:
            alt = min(p[0] + cost,d[p[1]])
            if d_exe[i] < alt : continue
            d_exe[i] = alt
            heapq.heappush(h,(alt, i))

    for i in range(N):
        print(d[i] + d_exe[i])

main()