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

using namespace std;

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

const int NMAX = 1e5, MMAX = 2e5;

const long long INF = 5e12;

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

int n, m;

long long d[NMAX + 5];

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

priority_queue <T> q;

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

int main() {
    fin >> n >> m;
    for (int i = 1; i <= m; i++) {
        int a, b;
        long long c;
        fin >> a >> b >> c;
        g[a].push_back({b, c});
    }
    init();
    q.push({0, 1});
    while (!q.empty()) {
        T aux = q.top();
        q.pop();
        if (aux.dp != d[aux.nod]) // e mai vechi
            continue;
        for (auto vecin : g[aux.nod]) {
            int nod_vecin = vecin.first;
            long long cost = vecin.second;
            if (d[nod_vecin] > d[aux.nod] + cost) {
                d[nod_vecin] = d[aux.nod] + cost;
                q.push({d[nod_vecin], nod_vecin});
            }
        }
    }
    for (int i = 2; i <= n; i++) {
        if (d[i] == INF)
            fout << "0 ";
        else
            fout << d[i] << " ";
    }
    fout << "\n";
    return 0;
}