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

using namespace std;

#define MAXN 50010

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

vector<pair<int, int>> G[MAXN];
priority_queue<pair<int, int>> PQ;

int n, m, x, y, c;
int costuri[MAXN], viz[MAXN];

void dijkstra(int nod) {
    for (int i = 1; i <= n; ++i) {
        costuri[i] = INT_MAX;
    }
    costuri[nod] = 0;
    PQ.push({0, nod});
    viz[nod] = 1;
    while (PQ.size()) {
        auto aux = PQ.top();
        int nodCurrent = aux.second;
        PQ.pop();
        if (!viz[nodCurrent]) {
            viz[nodCurrent] = 1;
            for (auto it:G[nodCurrent]) {
                if (costuri[nodCurrent] + it.second < costuri[it.first]) {
                    costuri[it.first] = costuri[nodCurrent] + it.second;
                    PQ.push({-costuri[it.first], it.first});
                }
            }
        }
    }
}

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

    while (m--) {
        f >> x >> y >> c;
        G[x].push_back({y, c});
    }

    dijkstra(1);

    for (int i = 2; i <= n; ++i) {
        if (costuri[i] == INT_MAX) {
            g << "0 ";
        } else {
            g << costuri[i] << ' ';
        }
    }

    return 0;
}