#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <queue>

using namespace std;

ifstream f("dijkstra.in"); ofstream g("dijkstra.out");

int n,m;

bool comp(pair <int, int> x, pair <int, int> y) {
    return x.first < y.first;
}
priority_queue <pair <int, int>, vector<pair <int, int> >, greater<pair<int,int> > > q;

vector < pair <int, int> > vecini[50005];

bool viz[50005]; int d[50005];


int main() {
    int x,dist,y,i,j;
    f>>n>>m;
    for(i = 1; i <= m; ++i) {
        f>>x>>y>>dist;
        vecini[x].push_back(make_pair(y,dist));
    }

    d[1] = 0;
    viz[1] = 1;
    for(i = 2; i <= n; ++i) {
        d[i] = 20000005;
    }
    q.push(make_pair(0,1));
    while(!q.empty()) {
        int minim = 20000005; int nod = q.top().second;
        viz[nod] = 1;
        q.pop();
        for(i = 0; i < vecini[nod].size(); ++i) {
           if(!viz[vecini[nod][i].first]) {
                if(d[nod] + vecini[nod][i].second < d[vecini[nod][i].first]) {
                    d[vecini[nod][i].first] = d[nod] + vecini[nod][i].second;
                    q.push(make_pair(d[vecini[nod][i].first],vecini[nod][i].first));
               //     cout<<nod<<' '<<vecini[nod][i].first;
                }
            }
        }
    }

    for(i = 2; i <= n; ++i) {
        if(d[i]==20000005) {g<<0<<' ';}
        else {g<<d[i]<<' ';}
    }
    return 0;
}