import heapq
from collections import defaultdict
def dijkstra(vnum, vs, edge):
    dist = [10**20]*vnum
    dist[vs] = 0 
    remain = set(range(vnum))
    Q = []
    heapq.heappush(Q,(0,vs))
    while Q:
        c, vn = heapq.heappop(Q)
        if vn not in remain :
            continue
        remain.remove(vn)
        for j in remain:
            if dist[vn] + edge[vn][j] < dist[j]:
                dist[j] = dist[vn] + edge[vn][j] 
                heapq.heappush(Q,(dist[j],j)) 
        if not remain:
            break
    return dist
def dijkstra1(vnum, vs, edge, dist0):
    dist = [10**20]*vnum
    dist[vs] = 0 
    remain = set(range(vnum))
    Q = []
    heapq.heappush(Q,(0,vs))
    while Q:
        c, vn = heapq.heappop(Q)
        if vn not in remain :
            continue
        remain.remove(vn)
        for j in remain:
            if dist[vn] + edge[vn][j] < dist[j]:
                dist[j] = min(dist[vn] + edge[vn][j], dist0[vn])
                heapq.heappush(Q,(dist[j],j)) 
        if not remain:
            break
    return dist
N, M = map(int, input().split())
Edge = [defaultdict(lambda: 10**20) for _ in range(N)]
for _ in range(M):
    a, b, c = map(int, input().split())
    Edge[a-1][b-1] = c
    Edge[b-1][a-1] = c
D = dijkstra(N, 0, Edge)
D1 = dijkstra1(N, 0, Edge, D)
print('\n'.join([str(i+j) for i, j in zip(D, D1)]))