#include <bits/stdc++.h>
using namespace std;

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

const int N = 5e4 + 5;
const int oo = 0x3f3f3f3f;

int n, m, x, y, vf, c, cmn[N];
vector<pair<int, int>> ad[N];
set<pair<int, int>> s;

void init(), dijkstra();
inline void prt();

int main()
{
    init();
    dijkstra();
    prt();
    return 0;
}

void init() {
    f >> n >> m;
    for (; m; m--) {
        f >> x >> y >> c;
        ad[x].push_back({ y, c });
    }
    memset(cmn, oo, sizeof(cmn));
}
inline void prt() {
    for (int i = 2; i <= n; i++)
        g << (cmn[i] == oo ? 0 : cmn[i]) << ' ';
}
void dijkstra() {
    cmn[1] = 0;
    s.insert({ 0, 1 });
    while (!s.empty()) {
        c = s.begin()->first;
        vf = s.begin()->second;
        s.erase({ c, vf });
        for (vector<pair<int, int>>::iterator it = ad[vf].begin(); it != ad[vf].end(); it++) {
            int cost = it->second;
            int nod = it->first;
            int aux = c + cost;
            if (aux < cmn[nod]) {
                if (cmn[nod] != oo) s.erase({ aux, nod });
                cmn[nod] = aux;
                s.insert({ aux, nod });
            }
        }
    }
}