#include<iostream.h>
#include<fstream.h>
int i,j,k,n,m,a[250001][4],d[50001],ok=1;
ifstream f("dijkstra.in");
ofstream h("dijkstra.out");
int main()
{f>>n>>m;
for(i=1;i<=m;i++)
		{f>>a[i][1]>>a[i][2]>>a[i][3];}
for(i=2;i<=n;i++)
		d[i]=1001;
d[1]=0;
 ok=1; int nr=1;
while(ok==1 && nr<n)
{  ok=0;
for(k=1;k<=m;k++)
		 if(d[a[k][2]] > d[a[k][1]] + a[k][3])
								 {d[a[k][2]]=d[a[k][1]]+a[k][3];
								  ok=1;}
nr++;}
for(i=2;i<=n;i++)
	 if(d[i]==1001)  h<<"0 ";
				else  h<<d[i]<<" ";
return 0;
}