#include <fstream>
#include <vector>
#include <queue>
#include <climits>
using namespace std;

const int NMAX = 50005;
const int INF = INT_MAX;

struct Edge {
    int to, cost;
};

vector<Edge> adj[NMAX];
int dist[NMAX];

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

    int N, M;
    fin >> N >> M;

    for (int i = 0; i < M; i++) {
        int A, B, C;
        fin >> A >> B >> C;
        adj[A].push_back({B, C});
    }

    for (int i = 1; i <= N; i++) {
        dist[i] = INF;
    }

    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
    dist[1] = 0;
    pq.push({0, 1});

    while (!pq.empty()) {
        int d = pq.top().first;
        int u = pq.top().second;
        pq.pop();

        if (d != dist[u]) continue;

        for (Edge e : adj[u]) {
            int v = e.to;
            int w = e.cost;
            if (dist[u] + w < dist[v]) {
                dist[v] = dist[u] + w;
                pq.push({dist[v], v});
            }
        }
    }

    for (int i = 2; i <= N; i++) {
        if (dist[i] == INF) fout << 0 << " ";
        else fout << dist[i] << " ";
    }

    fin.close();
    fout.close();
    return 0;
}