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

using namespace std;

void dijkstra(const int &nrNoduri, const int &nodStart, vector<pair<int, int>> v[], vector<int> &dist) {
    dist = vector<int>(nrNoduri + 1, INT_MAX);

    priority_queue<pair<int, int>, vector<pair<int, int>>, std::greater<>> q;
    q.emplace(0, nodStart);

    while (!q.empty()) {
        const auto [distNodCurent, nodCurent] = q.top();
        q.pop();

        if (dist[nodCurent] == INT_MAX) {
            dist[nodCurent] = distNodCurent;
            for (auto &[vecin, costMuchie]: v[nodCurent]) {
                const int d = distNodCurent + costMuchie;
                if (d < dist[vecin]) {
                    q.emplace(d, vecin);
                }
            }
        }
    }
}

int main() {
    ifstream fin("dijkstra.in");
    ofstream fout("dijkstra.out");
    vector<pair<int, int>> v[50001];
    int n, m;
    fin >> n >> m;
    for (int i = 1; i <= m; i++) {
        int a, b, c;
        fin >> a >> b >> c;
        v[a].emplace_back(b, c);
    }

    vector<int> dist;
    dijkstra(n, 1, v, dist);

    for (int i = 2; i <= n; i++) {
        if (dist[i] < INT_MAX)
            fout << dist[i] << ' ';
        else
            fout << "0 ";
    }
    fout.put('\n');
    fin.close();
    fout.close();
    return 0;
}