from heapq import *
def dijkstra(g,start):
    n = len(g)
    INF = 1<<61
    dist = [INF]*(n) #startからの最短距離
    dist[start] = dist[start+n//2] = 0
    q = [(0,start)] #(そこまでの距離、点)
    while q:
        dv,v = heappop(q)
        if dist[v] < dv: continue
        for to, cost in g[v]:
            if dv + cost < dist[to]:
                dist[to] = dv + cost
                heappush(q, (dist[to], to))
    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((b,c))
    g[a].append((b+n,0))
    g[b].append((a,c))
    g[b].append((b+n,0))
    g[a+n].append((b+n,c))
    g[b+n].append((a+n,c))
    
dist = dijkstra(g,0)
for i in range(n):
    print(dist[i] + dist[i+n])