#include<cstdio>
#include<vector>
#include<queue>
#include<utility>
using namespace std;
vector<pair<int,int> > v[50100];
priority_queue<pair<int,int> > Q;
int n,m,x,y,c,d[50100],used[50100],oo=2000000000;
void read(),solve();
int main()
{
	read();
	solve();
	return 0;
}
void read()
{
	freopen("dijkstra.in","r",stdin);
	freopen("dijkstra.out","w",stdout);
	scanf("%d%d",&n,&m);
	for(;m;m--)
	{
		scanf("%d%d%d",&x,&y,&c);
		v[x].push_back(make_pair(c,y));
	}
}
void solve()
{
	int nod,dist,i;
	vector<pair<int,int> >::iterator it;
	Q.push(make_pair(0,1));
	for(i=2;i<=n;i++)d[i]=oo;
	for(;Q.size();)
	{
		nod=Q.top().second;
		dist=Q.top().first; 
		Q.pop();
		if(dist>d[nod])continue;
		for(it=v[nod].begin();it!=v[nod].end();it++)
			if(dist+it->first<d[it->second])
			{
				d[it->second]=dist+it->first;
				Q.push(make_pair(d[it->second],it->second));
			}
	}
	for(i=2;i<=n;i++)d[i]==oo?printf("0 "):printf("%d ",d[i]);
}