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

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

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

	while (m--) {
		int a, b, c;
		scanf("%d%d%d", &a, &b, &c);
		v[a].push_back(make_pair(b, c));

	}
	for (int i = 1; i <= n; ++i) D[i] = inf;
	D[1] = 0;T[1] = 1;
	Q.push(1);
	while (!Q.empty()) {
		int nod = Q.front(); Q.pop();

		T[nod] = 0;
		for (int i = 0; i < v[nod].size(); ++i) if (D[nod] + v[nod][i].second < D[v[nod][i].first]) 
		{
			 D[v[nod][i].first] = D[nod] + v[nod][i].second;
			 
			 if (!T[v[nod][i].first]) Q.push(v[nod][i].first), T[v[nod][i].first]=1;

		}
	}
	for (int i = 2; i <= n; ++i) {
		if (D[i] == inf) D[i] = 0;
		if (i!=2) printf(" ");
		printf("%d", D[i]);
	}
	printf("\n");
	return 0;
}