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

using namespace std;

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

const int marime = 50005;
const int oo = 2e9;

int d[marime];
bool f[marime];
vector<pair<int, int>> mat[marime];
priority_queue<pair<int, int>> q;

int main() {
    int n, m;
    fin >> n >> m;

    for (int i = 1; i <= m; ++i) {
        int x, y, cost;
        fin >> x >> y >> cost;
        mat[x].push_back({y, cost});
    }

    for (int i = 2; i <= n; ++i) {
        d[i] = oo;
    }

    q.push({0, 1});
    f[1] = 1;

    while (!q.empty()) {
        int p = q.top().second;
        q.pop();
        f[p] = 0;

        for (int i = 0; i < mat[p].size(); ++i) {
            int vecin = mat[p][i].first;
            int cost = mat[p][i].second;

            if (d[vecin] > cost + d[p]) {
                d[vecin] = cost + d[p];
                if (f[vecin] == 0) {
                    q.push({-d[vecin], vecin});
                    f[vecin] = 1;
                }
            }
        }
    }

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

    return 0;
}