#include<fstream>
#include<vector>
#include<queue>
using namespace std;
#define pb push_back
#define nmax 50005
#define inf 1<<30
vector<int> g[nmax],c[nmax];
int fort[nmax],d[nmax],viz[nmax];
int n,m,k;
void citire ()
{
	ifstream fin("dijkstra.in");
	fin>>n>>m;
	int i,a,b,cost;
	//for(i=1;i<=k;i++)
		//fin>>fort[i];
	for(i=1;i<=m;i++)
	{
		fin>>a>>b>>cost;
		g[a].pb(b);
		//g[b].pb(a);
		c[a].pb(cost);
	//	c[b].pb(cost);
	}
	fin.close();
}

void dijkstra (int nod)
{
	int i,x;
	priority_queue<int> q;
	q.push(nod);
	for(i=1;i<=n;i++)
		{d[i]=inf;viz[i]=0;}
	d[nod]=0;
	while(!q.empty())
	{
		x=q.top();viz[x]=1;
		q.pop();
		for(i=0;i<g[x].size();i++)
			if(d[g[x][i]]>d[x]+c[x][i] )
			{
				d[g[x][i]]=d[x]+c[x][i];
				if(!viz[g[x][i])
				q.push(g[x][i]),viz[g[x][i]]=1;
			}
	}
}
int main ()
{
	citire ();
	int i;
	dijkstra(1);
	ofstream fout("dijkstra.out");
	for(i=2;i<=n;i++)
		if(d[i]!=inf) fout<<d[i]<<' ';
		else fout<<0;
	fout.close();
	return 0;
}