#include<fstream>
#include<vector>
#include<queue>
#define DIM 50005
#define str pair< int, int >
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int a, b, c, d[DIM], n, m, x[DIM], y[DIM];
vector< str > v[DIM];
priority_queue< str, vector<str>, greater<str> > q;
int main(){
    fin >> n >> m;
    for( int i = 1; i <= m; i++ ){
        fin >> a >> b >> c;
        v[a].push_back( make_pair( b, c ) );
    }
    for( int i = 1; i <= n; i++ ){
        d[i] = 2000000000;
    }
    d[1] = 0;
    q.push( make_pair( 0, 1 ) );
    while( !q.empty() ){

        str nod = q.top();
        q.pop();

        if( nod.first != d[nod.second] ){
            continue;
        }

        for( int i = 0; i < v[nod.second].size(); i++ ){
            int vecin = v[nod.second][i].first;
            int cost = v[nod.second][i].second;
            if( d[vecin] > d[nod.second] + cost ){
                d[vecin] = d[nod.second] + cost;
                q.push( make_pair( d[vecin], vecin ) );
            }
        }

    }
    for( int i = 2; i <= n; i++ ){
        fout << ( (d[i] == 2000000000) ? 0 : d[i] ) << " ";
    }
    return 0;
}