/* 
 * File:   main.cpp
 * Author: SpeeDemon
 *
 * Created on April 6, 2010, 7:00 PM
 */
#include <cstdlib>
#include <fstream>
#include <iterator>
#define Nmax 50001
#define oo 0x3f3f3f3f

/*
 * 
 */
using namespace std;
struct vertex
{
    int y, c;
    vertex* next;
} *G[Nmax];
int N=1;
int H[Nmax], P[Nmax], d[Nmax];
inline void add( int x, int y, int c )
{
    vertex* q=new vertex;
    q->y=y; q->c=c;
    q->next=G[x];
    G[x]=q;
}
inline void DownHeap( int k )
{
    int son;
    for( ; ; )
    {
        son=2*k;
        if( son > N )
            return;
        if( son < N && d[H[son+1]] < d[H[son]] )
            ++son;
        if( d[H[k]] <= d[H[son]] )
            return;
        swap( H[k], H[son] );
        swap( P[H[k]], P[H[son]] );
        k=son;
    }
}
inline void UpHeap( int k )
{
    int key=d[H[k]], f=k/2;
    while( k > 1 && key < d[H[f]] )
    {
        swap( H[k], H[f] );
        swap( P[H[k]], P[H[f]] );
        k=f;
        f/=2;
    }
}
inline int pop( void )
{
    int r=H[1];
    P[H[1]]=P[H[N]];
    H[1]=H[N];
    --N;
    DownHeap( 1 );
    return r;
}
inline void push( int k )
{
    H[++N]=k;
    P[k]=N;
    UpHeap(N);
}
int main(int argc, char** argv)
{
    vertex* it;
    int n, M, x, y, c;
    ifstream in( "dijkstra.in" );
    in>>n>>M;
    for( ; M; --M )
    {
        in>>x>>y>>c;
        add( x-1, y-1, c );
    }
    while( N )
    {
        x=pop();
        for( it=G[x]; it; it=it->next  )
        {
            if( !P[it->y] )
            {
                d[it->y]=d[x]+it->c;
                push( it->y );
                continue;
            }
            if( d[it->y] > d[x]+it->c )
            {
                d[it->y]=d[x]+it->c;
                UpHeap( P[it->y] );
            }
        }
    }
    ofstream out( "dijkstra.out" );
    copy( d+1, d+n, ostream_iterator<int>( out, " " ) );
    out<<'\n';
    return (EXIT_SUCCESS);
}