#include <fstream>
#include <cstdio>
#include <vector>
#include <queue>

using namespace std;

const int Inf = 1e9 + 5;
const int Dim = 5e4 + 5;

int n, m;
int d[Dim];

vector <vector <pair<int, int> > > G;

class comp {
public:
    bool operator() (const int &t1, const int &t2) {
        return d[t1] > d[t2];
    }
};

priority_queue <int, vector <int>, comp> coada;

int main() {
    freopen("dijkstra.in" , "r" , stdin);
    freopen("dijkstra.out" , "w" , stdout);

    scanf("%d %d", &n, &m);
    G.resize(n + 1);
    for(int i = 1; i <= m; ++i) {
        int x, y, cost;
        scanf("%d %d %d", &x, &y, &cost);
        G[x].push_back({y, cost});
    }

    fill(d + 1, d + n + 1, Inf);
    d[1] = 0;

    coada.push(1);
    while(!coada.empty()) {
        int node = coada.top();
        coada.pop();

        int sz = G[node].size();
        for(int i = 0; i < sz; ++i) {
            int nod = G[node][i].first;
            int cost = G[node][i].second;
            if(d[nod] > d[node] + cost) {
                d[nod] = d[node] + cost;
                coada.push(nod);
            }
        }
    }

    for(int i = 2; i <= n; ++i) {
        if(d[i] == Inf) d[i] = 0;
        printf("%d ", d[i]);
    }
    return 0;
}