#include<fstream>
#include<vector>
#include<queue>
#define inf 10000000
using namespace std;
struct nod
{
	int y,c;
};
vector<vector<nod> > a(50000);
vector<int> dist(50000,inf);
queue<int> q;
int n,m,x,y,c,i,j;
int main()
{
	ifstream f("dijkstra.in");
	ofstream g("dijkstra.out");
	f>>n>>m;
	for(;m;--m)
	{
		f>>x>>y>>c;
		a[x].push_back( (nod) {y,c} );
	}
	dist[1]=0;
	q.push(1);
	while(!q.empty())
	{
		x=q.front();
		for(i=0;i<a[x].size();i++)
			if(dist[a[x][i].y]>dist[x]+a[x][i].c)
			{
				dist[a[x][i].y]=dist[x]+a[x][i].c;
				q.push(a[x][i].y);
			}
			q.pop();
	}
	for(i=2;i<=n;i++)
		if(dist[i]!=inf)
			g<<dist[i]<<" ";
		else 
			g<<0;
}