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

using namespace std;

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

const int N = 50001;

int n, m, d[N], pred[N];
int nheap, h[N], poz[N];
bool viz[N];
vector <int> a[N], c[N];

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

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

    in.close();
}

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

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 st = p << 1, dr = p << 1 + 1, best = p;

    if (st <= nheap && d[ h[best] ] > d[ h[st] ]) best = st;
    if (dr <= nheap && d[ h[best] ] > d[ h[dr] ]) best = dr;

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

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

void dijkstra(int r) {
    for (int i = 1; i <= n; i++) {
        d[i] = INT_MAX;
        h[i] = poz[i] = i;
    }
    nheap = n;
    d[r] = 0;
    viz[1] = true;

    while (nheap > 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 (!viz[y] && d[x] + cost < d[y]) {
                d[y] = d[x] + cost;
                pred[y] = x;
                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();
}