import sys, heapq
def input():
	return sys.stdin.readline()[:-1]

class DijkstraList():
	#隣接リスト版
	#同一頂点の複数回探索を防ぐため訪問した頂点数を変数cntで持つ
	def __init__(self, adj, start):
		self.list = adj
		self.start = start
		self.size = len(adj)

	def solve(self):
		self.dist = [float("inf") for _ in range(self.size)]
		self.dist[self.start] = 0
		self.prev = [-1 for _ in range(self.size)]
		self.q = []
		self.cnt = 0

		heapq.heappush(self.q, (0, self.start))

		while self.q and self.cnt < self.size:
			u_dist, u = heapq.heappop(self.q)
			if self.dist[u] < u_dist:
				continue
			for v, w in self.list[u]:
				if self.dist[v] > u_dist + w:
					self.dist[v] = u_dist + w
					self.prev[v] = u
					heapq.heappush(self.q, (self.dist[v], v))
			self.cnt += 1
		return

	def distance(self, goal):
		return self.dist[goal]

	def path(self, goal):
		self.path = [goal]
		while self.path[-1] != self.start:
			self.path.append(self.prev[self.path[-1]])
		return self.path[::-1]

n, m = map(int, input().split())
adj = [[] for _ in range(2*n)]
for _ in range(m):
	a, b, c = map(int, input().split())
	adj[a-1].append([b-1, c])
	adj[b-1].append([a-1, c])
	adj[a-1].append([b-1+n, 0])
	adj[b-1].append([a-1+n, 0])
	adj[a-1+n].append([b-1+n, c])
	adj[b-1+n].append([a-1+n, c])

d = DijkstraList(adj, 0)
d.solve()

print(0)
for i in range(1, n):
	print(d.distance(i) + d.distance(i+n))