#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define f first
#define s second
#define inf 2000000000
#define NMAX 50000
#define ll long long

using namespace std;

ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

int n, m;
ll dist[NMAX+10];
bool viz[NMAX+10];
vector <pair <ll, int> > nod[NMAX+10];
priority_queue <pair <ll, int>, vector <pair <ll, int> >, greater <pair <ll, int> > > pq;

int main()
{
	fin >> n >> m;
	for(int i=1; i<=m; i++)
		{	int nod1, nod2;
			ll cost;
			fin >> nod1 >> nod2 >> cost;
			nod[nod1].push_back({cost, nod2});
		}
	for(int i=2; i<=n; i++)
		dist[i] = inf;
	pq.push({0, 1});
	while(!pq.empty())
		{	pair <ll, int> a = pq.top();
			pq.pop();
			if(viz[a.s])
				continue;
			viz[a.s] = 1;
			for(auto u : nod[a.s])
				if(!viz[u.s])
					{	ll d = a.f + u.f;
						if(d < dist[u.s])
							{	dist[u.s] = d;
								pq.push({d, u.s});
							}
					}
		}
	for(int i=2; i<=n; i++)
		{	if(dist[i] == inf)
				fout << 0 << ' ';
			else fout << dist[i] << ' ';
		}
	fout << '\n';
	return 0;
}