#include <fstream>
#include <vector>
#define inf 250000*20000

using namespace std;

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

int n, m, a, b, c, i, d[50001], p, minim, nr, vec, dist;
char f[50001];
vector<pair<int, int> > v[250001];

int main(){
    fin>>n>>m;
    while(m--){
        fin>>a>>b>>c;
        v[a].push_back(make_pair(b, c));
    }
    for(i=2;i<=n;i++)
        d[i] = inf;
    d[1] = 0;
    while(a){
        minim = inf;
        for(i=1;i<=n;i++)
            if(f[i] == 0){
                if(d[i] < minim){
                    minim = d[i];
                    p = i;
                }
            }
        if(minim == inf)
            break;
        f[p] = 1;
        for(i=0;i<v[p].size();i++){
            vec = v[p][i].first;
            dist = v[p][i].second;
            if(f[vec] == 0 && d[vec] > d[p] + dist)
                d[vec] = d[p] + dist;
        }

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