import sys
import heapq
input = sys.stdin.readline


def dijkstra(s, graph):
    n = len(graph)-1
    dist = [float("inf") for i in range(n+1)]
    dist[s] = 0
    pq = []
    heapq.heapify(pq)
    heapq.heappush(pq, (0, s))
    while pq:
        mini_dis, node = heapq.heappop(pq)
        if dist[node] < mini_dis:
            continue
        for w, point in graph[node]:
            if dist[point] < w:
                continue
            newlen = dist[node]+w
            if newlen < dist[point]:
                heapq.heappush(pq, (newlen, point))
                dist[point] = newlen
    return dist


def s_dijkstra(s, graph):
    n = len(graph)-1
    dist = [float("inf") for i in range(n+1)]
    dist[s] = 0
    dist[s+N] = 0
    pq = []
    heapq.heapify(pq)
    heapq.heappush(pq, (0, s))
    heapq.heappush(pq, (0, s+N))
    while pq:
        mini_dis, node = heapq.heappop(pq)
        if dist[node] < mini_dis:
            continue
        for w, point in graph[node]:
            if dist[point] < w:
                continue
            newlen = dist[node]+w
            if newlen < dist[point]:
                heapq.heappush(pq, (newlen, point))
                dist[point] = newlen
    return dist


N, M = map(int, input().split())
graph = [[] for i in range(N+1)]
special_graph = [[] for i in range(2*N+1)]


for _ in range(M):
    a, b, c = map(int, input().split())
    graph[a].append((c, b))
    graph[b].append((c, a))

    special_graph[a].append((0, b+N))
    special_graph[a].append((c, b))
    special_graph[a+N].append((c, b+N))
    special_graph[b].append((c, a))
    special_graph[b].append((0, a+N))
    special_graph[b+N].append((c, a+N))


distance = dijkstra(1, graph)
sub_distance = s_dijkstra(1, special_graph)
for i in range(1, N+1):
    ans = distance[i]+sub_distance[i+N]
    print(ans)