class Dijkstra():
    class Edge():
        def __init__(self, _to, _cost):
            self.to = _to
            self.cost = _cost

    def __init__(self, V):
        self.G = [[] for i in range(V)]
        self._E = 0
        self._V = V

    @property
    def E(self):
        return self._E

    @property
    def V(self):
        return self._V

    def add(self, _from, _to, _cost):
        self.G[_from].append(self.Edge(_to, _cost))
        self._E += 1

    def shortest_path(self, s):
        import heapq
        que = []
        d = [10**15] * self.V
        d[s] = 0
        heapq.heappush(que, (0, s))

        while len(que) != 0:
            cost, v = heapq.heappop(que)
            if d[v] < cost: continue

            for i in range(len(self.G[v])):
                e = self.G[v][i]
                if d[e.to] > d[v] + e.cost:
                    d[e.to] = d[v] + e.cost
                    heapq.heappush(que, (d[e.to], e.to))
        return d

import sys

input = sys.stdin.readline

N,M = map(int,input().split())
tour = Dijkstra(2*N)
for i in range(M):
    a,b,c = map(int,input().split())
    tour.add(2*a-2,2*b-2,c)
    tour.add(2*a-1,2*b-1,c)
    tour.add(2*a-1,2*b-2,0)
    a,b = b,a
    tour.add(2*a-2,2*b-2,c)
    tour.add(2*a-1,2*b-1,c)
    tour.add(2*a-1,2*b-2,0)

short_go = tour.shortest_path(1)
short_back = tour.shortest_path(0)
for i in range(N):
    print(short_go[2*i]*(i>0)+short_back[2*i])