#include<stdio.h>
#include<algorithm>

using namespace std;

const int maxn=50005;
const int inf=1<<30;

struct graf
{
	int nod,cost;
	graf *next;
};

graf *a[maxn];
int n,m,k;
int d[maxn],h[maxn],poz[maxn];


inline int left_son(int i)
{
	return 2*i;
}

inline int right_son(int i)
{
	return 2*i+1;
}
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()
{
	int x,y,z;
	freopen("dijkstra.in","r",stdin);
	scanf("%d %d",&n,&m);
	for(int i=1;i<=m;i++)
	{
		scanf("%d %d %d",&x,&y,&z);
		add(x,y,z);
	}
}

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

void downheap(int nod)
{
	int son;
	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[nod],h[son]);
			nod=son;
		}
		
	}while(son);
}
		
void dijkstra_heap()
{
	for(int i=2;i<=n;i++)
		d[i]=inf,poz[i]=-1;
	
	poz[1]=1;
	h[++k]=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()
{
	freopen("dijkstra.out","w",stdout);
	read();
	dijkstra_heap();
	for(int i=2;i<=n;i++)
		if(d[i]==inf) printf("0 ");
	else printf("%d ",d[i]);
}