#include<fstream>
#include<queue>
#include<algorithm>
#include<vector>
#include<cstring>

#define NMAX 50005
#define VEC G[nod][i].first
#define COST G[nod][i].second
#define PII pair<int,int> 

using namespace std;

ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

int n,m,d[NMAX];
vector<PII> G[NMAX];
priority_queue< PII,vector<PII>,greater<PII> > Heap;
bool use[NMAX];

void read()
{
	fin>>n>>m;
	for(int i=1,x,y,z;i<=m;i++)
	{
		fin>>x>>y>>z;
		G[x].push_back(make_pair(y,z));
	}
}

void Dijkstra()
{
	memset(d,127,sizeof d);
	d[1]=0;
	Heap.push(make_pair(d[1],1));
	for(int nod;Heap.size();)
	{
		nod=Heap.top().second;
		Heap.pop();
		if(use[nod])
			continue;
		use[nod]=1;
		for(size_t i=0;i<G[nod].size();i++)
			if(d[VEC]>d[nod]+COST)
			{
				d[VEC]=d[nod]+COST;
				Heap.push(make_pair(d[VEC],VEC));
			}
	}
}

int main()
{
	read();
	Dijkstra();
	for(int i=2;i<=n;i++)
		if(d[i]==d[0])
			fout<<"0 ";
		else
			fout<<d[i]<<' ';
	return 0;
}