#include<stdio.h>
#define inf 1<<30
#define N 50005
struct graf
{
	int nod,cost;
	graf *next;
};
int n,m;
int d[N];
graf *a[N];
bool incoada[N];
int coada[500000];
char c[30];
void adauga(int exp,int dest,int cost)
{
	graf *g=new graf;
	g->nod=dest;
	g->cost=cost;
	g->next=a[exp];
	a[exp]=g;
}
void citeste()
{
	int i,j,x,y,z;
	scanf("%d%d\n",&n,&m);
	for(i=0; i<m; i++)
	{
		fgets(c,30,stdin);
		x=y=z=0;
		for(j=0; (c[j]>='0')&&(c[j]<='9'); j++)
			x=x*10+c[j]-'0';
		j++;
		for(; (c[j]>='0')&&(c[j]<='9'); j++)
			y=y*10+c[j]-'0';
		j++;
		for(; (c[j]>='0')&&(c[j]<='9'); j++)
			z=z*10+c[j]-'0';
		adauga(x,y,z);
	}
}
void bellman_ford()
{
	int inc=0,sf=0;
	int now,i;
	graf *g;
	coada[0]=1;
	for(i=2; i<=n; i++)
		d[i]=inf;
	incoada[1]=true;
	while(inc<=sf)
	{
		now=coada[inc++];
		incoada[now]=false;
		g=a[now];
		while(g)
		{
			if(d[g->nod]>d[now]+g->cost)
			{
				d[g->nod]=d[now]+g->cost;
				if(!incoada[g->nod])
				{
					coada[++sf]=g->nod;
					incoada[g->nod]=true;
				}
			}
			g=g->next;
		}
	}
}
int main()
{
	freopen("dijkstra.in","r",stdin);
	freopen("dijkstra.out","w",stdout);
	int i;
	citeste();
	bellman_ford();
	for(i=2; i<n; i++)
		printf("%d ",d[i]==inf ? 0 : d[i]);
	printf("%d\n",d[i]==inf ? 0 : d[i]);
	return 0;
}