//100% working
#include<fstream>
#include <vector>
#include <queue>

#define NMAX 50001
#define INF 0x3f3f3f3f
using namespace std;

vector< pair< int, int> > G[NMAX];
int d[NMAX];
queue<int> Q;
int N;
bool is[NMAX];

inline void init()
{
	memset(d,INF,sizeof(d));
	memset(is,false,sizeof(is));
	d[1]=0;
	Q.push(1);
	is[1]=true;
}

inline void citire()
{
	int M;
	ifstream fin("dijkstra.in");
	fin>>N>>M;
	int x,y,c;
	for(int i=1;i<=M;i++)
		{
			fin>>x>>y>>c;
			G[x].push_back(make_pair(y,c));
		}
	fin.close();
}

inline void afisare()
{
	ofstream fout("dijkstra.out");
	for(int i=2;i<=N;i++)
		if(d[i]==INF) fout<<"0 ";
	else 
		fout<<d[i]<<" ";
	fout<<"\n";
	fout.close();
}

void bell()
{
	int x;
	while(!Q.empty())
	{
		x=Q.front();
		Q.pop();
		is[x]=0;
		for(vector< pair <int,int> >::iterator i=G[x].begin(); i!=G[x].end();i++)
		{
			if(d[x]+i->second<d[i->first])
			{
				d[i->first]=d[x]+i->second;
				if(!is[i->first])
				{
					Q.push(i->first);
					is[i->first]=true;
				}
			}
		}
	}
}

int main(int argc,char *argv[])
{
	init();
	
	citire();
	
	bell();
	
	afisare();
}