#include <fstream>
#include <vector>
#include <climits>

using namespace std;

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

const int N = 50002;

int n, m, nh;
int d[N], h[N], poz[N];
vector <int> a[N], c[N];

/// poz[i] - al catelea in heap este elementul i din vector
/// h[i] - al catelea din vector este elementul i din heap

void citire() {
    in >> n >> m;

    int x, y, z;
    for (int i = 0; i < m; i++) {
        in >> x >> y >> z;
        a[x].push_back(y);
        c[x].push_back(z);
    }

    in.close();
}

inline void myswap(int p, int q) {
    swap(h[p], h[q]);
    poz[ h[p] ] = p;
    poz[ h[q] ] = q;
}

void urca(int p) {
    while (p > 1 && d[ h[p] ] < d[ h[p >> 1] ]) {
        myswap(p, p >> 1);
        p >>= 1;
    }
}

void coboara(int p) {
    int q1 = 2*p, q2 = 2*p + 1, best = p;

    if (q1 <= nh && d[ h[best] ] > d[ h[q1] ]) best = q1;
    if (q2 <= nh && d[ h[best] ] > d[ h[q2] ]) best = q2;

    if (best != p) {
        myswap(p, best);
        coboara(best);
    }
}

void sterge(int p) {
    myswap(p, nh--);
    urca(p);
    coboara(p);
}

void dijkstra(int x0) {
    nh = n;
    for (int i = 1; i <= n; i++) {
        d[i] = INT_MAX;
        h[i] = poz[i] = i;
    }

    d[x0] = 0;
    urca(poz[x0]);
    while (nh > 0 && d[ h[1] ] != INT_MAX) {
        int x = h[1];
        sterge(1);
        for (int i = 0; i < a[x].size(); i++) {
            int y = a[x][i], cost = c[x][i];
            if (d[x] + cost < d[y]) {
                d[y] = d[x] + cost;
                urca(poz[y]);
            }
        }
    }
}

int main()
{
    citire();
    dijkstra(1);
    for (int i = 2; i <= n; i++) {
        if (d[i] != INT_MAX) out << d[i] << ' ';
        else out << 0 << ' ';
    }
    out.close();
}