#include<stdio.h>
#include<algorithm>
#include<fstream>
#define maxn 50005
#define inf 1<<30

using namespace std;

struct graf
{
	int nod,cost;
	graf *next;
};
int n,m,k;
graf *a[maxn];
int d[maxn],h[maxn],poz[maxn];

void add(int where,int what,int cost)
{
	graf *q=new graf;
	q->nod=what;
	q->cost=cost;
	q->next=a[where];
	a[where]=q;
}
void read()
{
	ifstream in("dijkstra.in");
	in>>n>>m;
	int a,b,c;
	for(int i=1;i<=m;i++)
	{
		in>>a>>b>>c;
		add(a,b,c);
	}
}
inline int left_son(int i)
{
	return i<<1;
}
inline int right_son(int i)
{
	return (i<<1)+1;
}

void downheap(int nod)
{
	int son=0;
	do
	{
		son=0;
		if(left_son(nod)<=k)
			son=left_son(nod);
		if(right_son(nod)<=k && d[h[left_son(nod)]]>d[h[right_son(nod)]])
			son=right_son(nod);
		if(d[h[son]]>d[h[nod]])
			son=0;
		if(son)
		{
			poz[h[nod]]=son;
			poz[h[son]]=nod;
			swap(h[son],h[nod]);
			nod=son;
		}
	}while(son);
}

void upheap(int nod)
{
	while(nod/2>0 && (d[h[nod]]<d[h[nod/2]]))
	{
			poz[h[nod]]=nod/2;
			poz[h[nod/2]]=nod;
			swap(h[nod],h[nod/2]);
			nod=nod/2;
		
	}
}

void dijkstra()
{
	for(int i=2;i<=n;i++)
		d[i]=inf,poz[i]=-1;
	k=1;
	h[1]=1;
	poz[1]=1;
	int min,pmin=0;
	while(k)
	{
		min=h[1];
		swap(h[1],h[k]);
		poz[h[1]]=1;
		--k;
		downheap(1);
		graf *t=a[min];
		while(t)
		{
			if(d[t->nod]>d[min]+t->cost)
		    {
				d[t->nod]=d[min]+t->cost;
				if(poz[t->nod]!=-1)
					upheap(poz[t->nod]);
				else
				{
					h[++k]=t->nod;
					poz[h[k]]=k;
					upheap(k);
				}
			}
			t=t->next;
		}
	}
}

int main()
{
	ofstream out("dijkstra.out");
	read();
	dijkstra();
	for(int i=2;i<=n;i++)
		if(d[i]==inf) out<<"0 ";
	else out<<d[i]<<" ";
}