/*
    Look at me!
    Look at me!
    The monster inside me has grown this big!
*/
 
#include<fstream>
#include<iostream>
#include<cstdio>
#include<map>
#include<set>
#define FIT(a,b) for(vector<pair<int,int> >::iterator a=b.begin();a!=b.end();a++)
#define RIT(a,b) for(vector<int>::reverse_iterator a=b.end();a!=b.begin();++a)
#include<stack>
#define ROF(a,b,c) for(int a=b;a>=c;--a)
#include<vector>
#include<algorithm>
#define FOR(a,b,c) for(int a=b;a<=c;++a)
#define REP(a,b) for(register int a=0;a<b;++a)
#include<cstring>
#include<bitset>
#include<cmath>
#include<iomanip>
#include<queue>
#define debug cerr<<"OK";
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ll long long
#define ull unsigned long long
#define inf 1<<30
#define eps 1.e-10
#define N 100100
using namespace std;
/*int dx[]={0,0,0,1,-1};
int dy[]={0,1,-1,0,0};*/
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
priority_queue<pii > q;
vector<pii > v[N];
int D[N],n,m,viz[N],x,c,y;
int main ()
{
    f>>n>>m;
	FOR(i,1,m)
	{
		f>>x>>y>>c;
		v[x].pb(mp(y,c));
	}
	FOR(i,2,n)
	D[i]=inf;
	q.push(mp(0,1));
	while(!q.empty())
	{
		while(!q.empty()&&viz[q.top().se])
			q.pop();
		if(q.empty())
			break;
		x=q.top().se;
		viz[x]=1;
		q.pop();
		FIT(it,v[x])
		if(D[x]+it->se<D[it->fi])
		{
			D[it->fi]=D[x]+it->se;
			q.push(mp(-D[it->fi],it->fi));
		}
	}
	FOR(i,2,n)
	if(D[i]!=inf)
		g<<D[i]<<" ";
	else
		g<<"0 ";
    return 0;
}