import sys
readline=sys.stdin.readline
import heapq

class Graph:
    def __init__(self,V,edges=False,graph=False,directed=False,weighted=False,inf=float("inf")):
        self.V=V
        self.directed=directed
        self.weighted=weighted
        self.inf=inf
        if not graph:
            self.edges=edges
            self.graph=[[] for i in range(self.V)]
            if weighted:
                for i,j,d in self.edges:
                    self.graph[i].append((j,d))
                    if not self.directed:
                        self.graph[j].append((i,d))
            else:
                for i,j in self.edges:
                    self.graph[i].append(j)
                    if not self.directed:
                        self.graph[j].append(i)
        else:
            self.graph=graph
            self.edges=[]
            for i in range(self.V):
                if self.weighted:
                    for j,d in self.graph[i]:
                        if self.directed or not self.directed and i<=j:
                            self.edges.append((i,j,d))
                else:
                    for j in self.graph[i]:
                        if self.directed or not self.directed and i<=j:
                            self.edges.append((i,j))

    def Dijkstra(self,s,route_restoration=False):
        dist=[self.inf]*self.V
        dist[s]=0
        hq=[(0,s)]
        if route_restoration:
            parents=[None]*self.V
        while hq:
            dx,x=heapq.heappop(hq)
            if dist[x]<dx:
                continue
            for y,dy in self.graph[x]:
                if dist[y]>dx+dy:
                    dist[y]=dx+dy
                    if route_restoration:
                        parents[y]=x
                    heapq.heappush(hq,(dist[y],y))
        if route_restoration:
            return dist,parents
        else:
            return dist

N,M=map(int,readline().split())
edges0=[]
edges1=[]
for _ in range(M):
    a,b,c=map(int,readline().split())
    a-=1;b-=1
    edges0.append((a,b,c))
    edges1.append((a,b,c))
    edges1.append((b,a,c))
    edges1.append((a+N,b+N,c))
    edges1.append((b+N,a+N,c))
    edges1.append((a,b+N,0))
    edges1.append((b,a+N,0))
for i in range(N):
    edges1.append((i,i+N,0))
G0=Graph(N,edges=edges0,weighted=True)
G1=Graph(2*N,edges=edges1,weighted=True,directed=True)
dist0=G0.Dijkstra(0)
dist1=G1.Dijkstra(0)
for i in range(N):
    ans=dist0[i]+dist1[i+N]
    print(ans)