/// dijklucastra
#include <bits/stdc++.h>
#pragma GCC optimize("O3")

using namespace std;

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

const int NMAX = 5e4;

struct T {
    int dp, nod;
    bool operator < (const T &other) const {
        return dp > other.dp;
    }
};

int n, m, dist[NMAX + 5];

vector <pair <int, int>> g[NMAX + 5];

priority_queue <T> q;

void init () {
    for (int i = 2; i <= n; i++)
        dist[i] = INT_MAX;
}

int main() {
    fin >> n >> m;
    for (int i = 1; i <= m; i++) {
        int x, y, c;
        fin >> x >> y >> c;
        g[x].push_back({y, c});
    }
    init();
    q.push({0, 1});
    while (!q.empty()) {
        T aux = q.top();
        q.pop();
        for (auto vecin : g[aux.nod]) {
            int nod_vecin = vecin.first, cost = vecin.second;
            if (dist[nod_vecin] > dist[aux.nod] + cost) {
                dist[nod_vecin] = dist[aux.nod] + cost;
                q.push({dist[nod_vecin], nod_vecin});
            }
        }
    }
    for (int i = 2; i <= n; i++) {
        if (dist[i] == INT_MAX)
            fout << 0 << " ";
        else
            fout << dist[i] << " ";
    }
    return 0;
}