#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <utility>
#include <string>
#include <cstring>
#include <set>
#define ll long long

using namespace std;

const ll INF = 1e12;

struct Data {
    int node;
    ll cost;

    bool operator< (const Data &other) const {
        if(cost == other.cost)
            return node < other.node;
        return cost < other.cost;
    }
};

int main() {
    ifstream in("dijkstra.in");
    ofstream out("dijkstra.out");

    int n, m;
    in >> n >> m;
    vector<vector<pair<int, int>>> g(n + 1);
    for(int i = 1; i <= m; i ++) {
        int x, y, c;
        in >> x >> y >> c;
        g[x].push_back({y, c});
    }

    vector<ll> dist(n + 1, INF);
    set<Data> s;
    dist[1] = 0;
    s.insert({1, 0});

    while(s.size()) {
        Data from = *s.begin();
        s.erase(from);

        for(auto it : g[from.node])
            if(dist[it.first] > dist[from.node] + 1LL * it.second) {
                s.erase({it.first, dist[it.first]});
                dist[it.first] = dist[from.node] + 1LL * it.second;
                s.insert({it.first, dist[it.first]});
            }
    }

    for(int i = 2; i <= n; i ++) {
        if(dist[i] == INF)
            dist[i] = 0;
        out << dist[i] << " ";
    }

    return 0;
}