#include<fstream.h>
#include<vector>
#include<algorithm>

using namespace std; 

struct dij { int ind,cost;};

vector < pair <int, int> > v[50005];

int m,n,p,poz[51000],h[50100],dist[50100],sw[50100];



void upheap (int k)
{
	while (k>=1 && dist[h[k]]<dist[h[k>>=1]])
	{
		poz[h[k]]=(poz[h[k]]^poz[h[k>>=1]])^(poz[h[k>>=1]]=poz[h[k]]);
		h[k]=(h[k>>=1]^h[k])^(h[k>>=1]=h[k]);
		k>>=1;
	}
}

void downheap()
{
	int x=1,y=p;
	while (x!=y)
	{
		y=x;
		if (y<<1<=p && dist[h[y]]>dist[h[x<<1]]) x<<=1;
		if ((y<<1)+1<=p && dist[h[y]]>dist[h[2*y+1]]) x=2*y+1;
		poz[h[x]]=(poz[h[x]]^poz[h[y]])^(poz[h[y]]=poz[h[x]]);
		h[x]=(h[y]^h[x])^(h[y]=h[x]);
	}
}

void dijkstra () 
{
	
	vector< pair<int, int> >:: iterator  it;
	
	int inf,c,i;
	
	inf=2000000000;
	for (i=2;i<=n;i++)
		dist[i]=inf;
	dist[i]=0;
	
	h[1]=1;
	poz[1]=1;
	sw[1]=1;
	p=1;
	
	while (p)
	{
		c=dist[h[1]];
		for (it=v[h[1]].begin();it<v[h[1]].end();++it)
			if ((c+it->second)<dist[it->first])
				if (sw[it->first]==1)
				{
					dist[it->first]=c+it->second;
					upheap(poz[it->first]);
				}
				else 
				{
					sw[it->first]=1;
					dist[it->first]=c+it->second;
					h[++p]=it->first;
					upheap(p);
				}
		sw[h[1]]=0;
		h[1]=h[p--];
		poz[h[1]]=1;
		downheap();
	}
}

void afisare()
{
	int i;
	ofstream g("dijkstra.out");
	int inf =2000000000;
	for (i=2;i<=n;++i)
	{
		if (dist[i]==inf)
			dist[i]=0;
		g<<dist[i]<<' ';
	}
	g.close();
}

int main ()
{
	int i,a,b,c;
	dij nod;
	ifstream f("dijkstra.in");
	f>>n>>m;
	for (i=1;i<=m;i++)
	{
		f>>a>>b>>c;
		v[a].push_back(make_pair (b,c));
	}
	f.close();
	dijkstra();
	afisare();
	return 0;
}