#include<fstream>
#include<vector>
#include<queue>
using namespace std;
#define nmax 50100
#define pb push_back
#define inf 1000000000
vector<int> g[nmax],c[nmax];
int d[nmax];
priority_queue <int> q;
int viz[nmax];
int n,sf,inc,m;
int main ()
{
	ifstream fin("dijkstra.in");
	ofstream fout("dijkstra.out");
	int i,j,k,a,b,t;
	fin>>n>>m;
	for(i=1;i<=m;i++)
		fin>>a>>b>>t,g[a].pb(b),c[a].pb(t);
	for(i=1;i<=n;i++)
		d[i]=inf;
	q.push(1);d[1]=0;
	while(!q.empty())
	{
		a=q.top();
		q.pop();
		for(i = 0; i < g[a].size(); i++)
        if( d[ g[a][i] ] > d[a] + c[a][i] )
          d[ g[a][i] ] = d[a] + c[a][i], q.push( g[a][i]);
	}
	for(i = 2; i <= n; i++)
        if(d[i]==inf) fout<<0<<' ';
		else fout<<d[i]<<' ';

	return 0;
}