#include <vector>
#include <fstream>
#include <cstdlib>
#define N_MAX 50011
#define pr pair< int, int >

using namespace std;
int lHeap;
vector< pr > G[N_MAX];
vector< pr >::const_iterator it, iend;
bool isIn[N_MAX];
int H[N_MAX], P[N_MAX], d[N_MAX];
inline void _swap( int& x, int& y ) { int aux=x; x=y; y=aux; }
inline int _min( int x, int y ) { return ( x <= y ? x : y ); }
inline int _max( int x, int y ) { return ( x >= y ? x : y ); }
void UpHeap( int k )
{
	for( int son=2*k; son <= lHeap; son*=2 )
	{
		if( son < lHeap && d[H[son]] > d[H[son+1]] )
			++son;
		if( H[k] <= H[son] )
			return;
		_swap( H[k], H[son] );
		P[H[k]]=k;
		P[H[son]]=son;
	}
}
void DownHeap( int k )
{
	int key=d[H[k]], f=k/2;
	for( ; k > 1 && key < d[H[f]]; k=f, f/=2 )
	{
		swap( H[k], H[f] );
		P[H[k]]=k;
		P[H[f]]=f;
	}
}
inline int pop()
{
	int r=H[1];
	H[1]=H[lHeap];
	P[H[1]]=1;
	--lHeap;
	DownHeap(1);
	return r;
}
inline void push( int k, int dist )
{
	d[k]=dist;
	H[++lHeap]=k;
	P[k]=lHeap;
	UpHeap( lHeap );
}
int main( void )
{
	int N, M, x, y, c;
	ifstream in( "dijkstra.in" );
	for( in>>N>>M; M; --M )
	{
		in>>x>>y>>c;
		G[x].push_back( pr( y, c ) );
	}
	for( push( 1, 0 ); lHeap; )
	{
		x=pop();
		for( it=G[x].begin(), iend=G[x].end(); it < iend; ++it )
		{
			if( false == isIn[it->first] )
			{
				isIn[it->first]=true;
				push( it->first, d[x]+it->second );
			}
			else if( d[it->first] > d[x]+it->second )
				 {
					 d[it->first]=d[x]+it->second;
					 UpHeap( P[it->first] );
				 }
		}
	}
	ofstream out( "dijkstra.out" );
	for( x=2; x <= N; ++x )
		out<<d[x]<<' ';
	out<<'\n';
	return EXIT_SUCCESS;
}