#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, m, x, y, c;
vector<int> a[250250];
map<pair<int,int>, int>cost;
int rez[60000], bf[2502500];
bool viz[60000];
void bfs()
{
	bf[1] = 1;
	int st = 1, dr = 1;
	while(st <= dr)
	{
		for (vector<int>::iterator it = a[bf[st]].begin(); it != a[bf[st]].end(); it++)
		{
			rez[*it] = min(rez[*it],rez[bf[st]] + cost[make_pair(bf[st],*it)]);
			dr++;
			bf[dr] = *it;
		}
		st++;
	}
}
int main()
{
	ifstream cin("dijkstra.in");
	ofstream cout("dijkstra.out");
	cin >> n >> m;
	for (int i = 0; i < m; i++)
	{
		cin >> x >> y >> c;
		a[x].push_back(y);
		cost[make_pair(x,y)] = c;
	}
	for (int i = 0; i <= n; i++) rez[i] = 1 << 30;
	rez[1] = 0;
	bfs();
	for (int i = 2; i <= n; i++) cout << (rez[i] == 1 <<30 ? 0:rez[i]) << " ";
}