#include <iostream>
#include <fstream>
#include <vector>
#define INF 2100000000

using namespace std;

ifstream fin  ("dijkstra.in");
ofstream fout ("dijkstra.out");

vector < pair<int, int> > v[50005];
int f[50005], d[50005];
int n, m, ii, jj, cc;
int minn, nod;

int main (){
    fin>>n>>m;
    for(int i=1; i<=m; i++){
        fin>>ii>>jj>>cc;
        v[ii].push_back( {jj, cc} );
    }

    for(int i=2; i<=n; i++)
        d[i]=INF;

    while(1){
        minn=INF;
        for(int i=1; i<=n; i++)
            if(f[i] != 1 && d[i] < minn){
                minn=d[i];
                nod=i;
            }

        if(minn == INF)
            break;

        f[nod]=1;
        for(int i=0; i<v[nod].size(); i++)
            d[ v[nod][i].first ]=min(d[ v[nod][i].first ], d[nod] + v[nod][i].second);
    }

    for(int i=2; i<=n; i++)
        if(d[i] == INF)
            fout<<0<<" ";
        else
            fout<<d[i]<<" ";;
    return 0;
}