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

using namespace std;

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

int n,m;

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 i, x, y, c;
    f>>n>>m;
    for(i = 1; i <= m; ++i) {
        f>>x>>y>>c;
        vecini[x].push_back(make_pair(y,c));
    }
    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 nod = q.top().second;
        int cost = q.top().first;
        q.pop();
        viz[nod] = 1;
        m = vecini[nod].size();
        if(cost != d[nod]) continue;
        for(i = 0; i < m; ++i) {
            if(!viz[vecini[nod][i].first]) {
                if(d[vecini[nod][i].first] > d[nod] + vecini[nod][i].second) {
                    d[vecini[nod][i].first] = d[nod] + vecini[nod][i].second;
                    q.push(make_pair(d[vecini[nod][i].first],vecini[nod][i].first));
                }
            }
        }
    }
    for(i = 2; i <= n; ++i) {
        if(d[i] == 20000005) g<<0<<' '; else g<<d[i]<<' ';
    }
    return 0;
}