#include <iostream>
#include <cstdlib>
#include <cstring>
#include <cstdio>
#include <cmath>

using namespace std;

const int MAXN=100001;
const int MAXM=400001;
const int M=MAXN+6;
const int oo=1000000000;

struct edge
{
	int t,c;
	edge *p;
}e[MAXM],*v[MAXN],*path[MAXN];

int n,m,i,j,k,d[MAXN],Q[MAXN+10],h,t,s,es=-1;
bool iq[MAXN];

inline void addedge(int i,int j,int c)
{
	e[++es].t=j; e[es].c=c; e[es].p=v[i]; v[i]=e+es;
}

void spfa()
{
	memset(iq,false,sizeof(iq));
	s=t=h=1;
	Q[s]=1;
	for (i=1;i<=n;i++)
		d[i]=oo;
	d[1]=0;
	iq[1]=true;
	while (s)
	{
		k=Q[h];
		for (edge *x=v[k];x;x=x->p)
			if (x->c+d[k]<d[x->t])
			{
				d[x->t]=x->c+d[k];
				path[x->t]=x;
				if (!iq[x->t])
				{
					t=(t+1)%M;
					Q[t]=x->t;
					iq[x->t]=true;
					++s;
				}
			}
		h=(h+1)%M;
		--s;
		iq[k]=false;
	}
}

void sbfa()
{
	memset(iq,false,sizeof(iq));
	s=t=h=1;
	Q[s]=1;
	for (int i=1;i<=n;i++)
		d[i]=oo;
	d[1]=0;
	iq[1]=true;
	while (s)
	{
		k=Q[h];
		for (edge *x=v[k];x;x=x->p)
			if (x->c+d[k]<d[x->t] && x!=path[i])
			{
				d[x->t]=x->c+d[k];
				if (!iq[x->t])
				{
					t=(t+1)%M; 
					Q[t]=x->t;
					iq[x->t]=true;
					++s;
				}
			}
		h=(h+1)%M;
		--s;
		iq[k]=false;
	}
}

int main()
{
	freopen("travel.in","r",stdin);
	freopen("travel.out","w",stdout);
	scanf("%d%d",&n,&m);
	while (m--)
	{
		scanf("%d%d%d",&i,&j,&k);
		addedge(i,j,k);
		addedge(j,i,k);
	}
	spfa();
	for (i=2;i<=n;i++)
	{
		sbfa();
		if (d[i]==oo) printf("-1\n");
		else printf("%d\n",d[i]);
	}
	return 0;
}