#include <fstream>
#include <vector>
#include <queue>
#include <utility>
#include <climits>
#include <stdio.h>
#include <fstream>

using namespace std;

vector< pair<int, int> > adj[50001];
int dist[50001];


int main() {
    ifstream fin("dijkstra.in");
    ofstream fout("dijkstra.out");
    int n, m, i, u, v, c;
    fin >> n >> m;
    for (i = 0; i < m; i++) {
        fin >> u >> v >> c;
        adj[u].push_back(make_pair(v, c));
    }
    for (i = 1; i <= n; i++) {
        dist[i] = INT_MAX;
    }

    priority_queue<pair<int, int>, vector< pair<int, int> >, greater< pair<int, int> > > heap; // pair<distance, node>
    dist[1] = 0;
    heap.push(make_pair(0, 1));

    while (!heap.empty()) {
        pair<int, int> current = heap.top();
        heap.pop();

        if (current.first > dist[current.second]) {
            continue;
        }

        for (vector< pair<int, int> >::iterator it = adj[current.second].begin(); it != adj[current.second].end(); ++it) {
            // try to relax
            if (dist[it->first] > dist[current.second] + it->second) {
                dist[it->first] = dist[current.second] + it->second;
                heap.push(make_pair(dist[it->first], it->first));
            }
        }
    }

    for (i = 2; i <= n; i++) {
        if (dist[i] == INT_MAX) {
            fout << "0 ";
        } else {
            fout << dist[i] << " ";
        }
    }
    return 0;
}