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

using namespace std;

ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");

vector<vector<pair<int, int>>> graf;
int n, m;
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> q;
vector<int> dist;
bitset<50003> viz;

void dijkstra() {
    dist[1] = 0;
    q.push({0, 1});
    while (!q.empty()) {
        pair<int, int> current = q.top();
        q.pop();
        if (viz[current.second] == 0) {
            for (pair <int, int> nei : graf[current.second]) {
                if (dist[nei.first] > dist[current.second] + nei.second) {
                    dist[nei.first] = dist[current.second] + nei.second;
                    q.push({dist[nei.first], nei.first});
                }
            }
            viz[current.second] = 1;
        }
    }
}

int main() {
    cin >> n >> m;
    graf.resize(n + 2);
    dist.resize(n + 2, INT_MAX);
    for (int i = 1 ; i <= m ; ++i) {
        int src, dest, length;
        cin >> src >> dest >> length;
        graf[src].push_back({dest, length});
    }
    dijkstra();
    for (int i = 2 ; i <= n ; ++i) {
        cout << ((dist[i] == INT_MAX) ? 0 : dist[i]) << " ";
    }
    return 0;
}