#include <cstdio>
#include <vector>
#include <queue>
using namespace std;

#define NMAX 50001
#define INFI 0x3f3f3f3f

int D[ NMAX ], T[ NMAX ];
vector < pair < int, int > > V[ NMAX ];
priority_queue < pair < int, int > > Q;


int main () {

    freopen( "dijkstra.in", "r", stdin );
    freopen( "dijkstra.out", "w", stdout );

    int n, m, i, j, x, y, c, nod, dis, fiu;

    scanf( "%d%d", &n,&m );
    while ( m-- ) {
        scanf( "%d%d%d", &x,&y,&c );
        V[ x ].push_back( { y, c } );
    }

    for ( i = 2; i <= n; ++i ) D[ i ] = INFI;

    Q.push( { 0, 1 } );
    while ( !Q.empty() ) {
        nod = Q.top().second;
        Q.pop();

        if ( T[ nod ] ) continue;
        T[ nod ] = 1 ;

        for ( i = 0; i < V[ nod ].size(); ++i ) {
            fiu = V[ nod ][ i ].first;
            c = V[ nod ][ i ].second;
            if ( D[ fiu ] > D[ nod ] + c  ) {
                D[ fiu ] = D[ nod ] + c ;
                Q.push( { -D[ fiu ], fiu } );
            }
        }
    }

    for ( i = 2; i <= n; ++i )
        if ( D[ i ] != INFI ) printf( "%d ", D[ i ] );
        else printf( "0 ");

    return 0;
}