#include<cstdio>
#include<vector> 
#define MAX_N 50010
#define oo 1<<20
using namespace std;
int n,m,a,b,c,i,j,d[MAX_N],u[MAX_N];
vector<pair<int,int> > V[MAX_N];
void read(),solve(),show();
int main()
{
	read();
	solve();
	show();
	return 0;
}
void read()
{
	freopen("dijkstra.in","r",stdin);
	freopen("dijkstra.out","w",stdout);
	scanf("%d%d",&n,&m);
	for(i=1;i<=m;i++)
		scanf("%d%d%d",&a,&b,&c),V[a].push_back(make_pair(b,c));
}
void solve()
{
	int min,pmin=0;
	vector<pair<int,int> >::iterator it;
	for(i=2;i<=n;i++)d[i]=oo;//initializam & selectam primul nod
	for(i=1;i<=n;i++)
	{
		min=oo;
		for(j=1;j<=n;j++)//cautam cel mai mic cost
			if(d[j] < min && !u[j])
				pmin=j,min=d[j];
		u[pmin]=1;//vizitam
		//relaxeaza graful
		for(it=V[pmin].begin();it!=V[pmin].end();it++)			 
			if(d[it->first] > d[pmin]+it->second) 
				d[it->first] = d[pmin]+it->second;
	}
}
void show()
{
	for(i=2;i<=n;i++)
		printf("%d ",(d[i]==oo?0:d[i]));
}