#include <bits/stdc++.h>
using namespace std;
#define elem pair<int, int>

int main() {
	freopen("dijkstra.in", "r", stdin);
	freopen("dijkstra.out", "w", stdout);
	int n, m;
	scanf("%d %d", &n, &m);
	vector<vector<elem>> nodes(n + 1);
	while (m--) {  //  add nodes
		int a, b, lg;
		scanf("%d %d %d", &a, &b, &lg);
		nodes[a].push_back(elem(lg, b));
	}

	vector<int> minim(n + 1, INT_MAX);
	priority_queue<elem, vector<elem>, greater<elem>> coada;
	coada.push(elem(0, 1));
	while (coada.size()) {  //  bfs
		elem from = coada.top();
		coada.pop();
		if (minim[from.second] <= from.first)
			continue;
		minim[from.second] = from.first;
		for (elem act : nodes[from.second])
			coada.push(elem(act.first + from.first, act.second));
	}
	for (int i = 2; i < minim.size(); i++)  //  show
		printf("%d ", minim[i] == INT_MAX ? 0 : minim[i]);
	return 0;
}