#include <cstdio>
#include <iostream>
#include <vector>
#include <set>
#include <queue>

#define inf 50000001
#define nmax 50001
using namespace std;

priority_queue<pair<int, int> > Q;
vector<vector<pair<int, int> > > v;
int D[nmax];
int main() {
	freopen("dijkstra.in", "r", stdin);
	freopen("dijkstra.out", "w", stdout);
	int n, m;
	
	v.resize(n+3);
    cin >> n >> m;

	while (m--) {
		int a, b, c;
		cin >> a >> b >> c;
		v[a].push_back(make_pair(b, c));

	}
	for (int i = 1; i <= n; ++i) D[i] = inf;
	D[1] = 0;
	Q.push(make_pair(0, 1));
	while (!Q.empty()) {
		pair<int, int> nod = Q.top(); Q.pop();
		if (D[nod.second] != nod.first) continue;
		for (int i = 0; i < v[nod.second].size(); ++i) if (nod.first + v[nod.second][i].second < D[v[nod.second][i].first]) 
		{
			 D[v[nod.second][i].first] = nod.first + v[nod.second][i].second;
			 Q.push(make_pair(D[v[nod.second][i].first], v[nod.second][i].first));
		}
	}
	for (int i = 2; i <= n; ++i) {
		if (D[i] == inf) D[i] = 0;
		if (i!=2) cout << " ";
		cout << D[i];
	}
cout << '\n';
	return 0;
}