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

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;

int main()
{
    f >> n >> m;

    vector <pair <int, int> > a[n + 5];

    vector <bool> viz(n + 5, 0);

    vector <int> cost(n + 5, 1e9);

    for (int i = 1; i <= m; ++i) {
        int x, y, z;

        f >> x >> y >> z;

        a[x].push_back({y, z});
    }

    cost[1]  = 0;

    q.push({0, 1});

    while (!q.empty()) {
        pair <int, int> nod = q.top();

        q.pop();

        if (viz[nod.second]) {
            continue;
        }

        viz[nod.second] = 1;

        for (auto vecin : a[nod.second]) {
            if (nod.first + vecin.second < cost[vecin.first]) {
                cost[vecin.first] = nod.first + vecin.second;
                q.push({cost[vecin.first], vecin.first});
            }
        }
    }

    for (int i = 2; i <= n; ++i) {
        if (cost[i] == 1e9) {
            cost[i] = 0;
        }

        g << cost[i] << ' ';
    }

    return 0;
}