#include <bits/stdc++.h>

using namespace std;

#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")


#define ar array
#define em emplace_back
#define ll long long
#define pi pair<int, int>
#define pb push_back
#define mp make_pair
#define all(v) (v).begin(), v.end()
#define dbg(x) cout << #x <<": " << x << "\n";


const string fileName = "dijkstra";
ifstream fin(fileName + ".in");
ofstream fout(fileName + ".out");

const int mxn = 50000;

int n, m;
int d[mxn + 5];
vector<pi > g[mxn + 5];

priority_queue<pair<int, int>, vector<pair<int, int> >, greater<pair<int, int> > > q;

void dij(int nod) {

    int w;

    fill(d + 1, d + n + 1, 2e9);
    d[nod] = 0;
    q.push(mp(0, nod));

    while (!q.empty()) {
        nod = q.top().second;
        w = q.top().first;
        q.pop();
        if (d[nod] != w) continue;

        for (auto i: g[nod]) {
            if (i.first + d[nod] < d[i.second]) {
                d[i.second] = i.first + d[nod];
                q.push(mp(d[i.second], i.second));
            }

        }

    }
}

int main() {

    ios_base::sync_with_stdio(false);
    cin.tie();

    fin >> n >> m;
    for (int i = 1; i <= m; ++i) {
        int x, y, w;
        fin >> x >> y >> w;
        g[x].pb(mp(w, y));

    }

    dij(1);

    for (int i = 2; i <= n; ++i)
        if (d[i] != 2e9)
            fout << d[i] << " ";
        else fout << "0 ";


    return 0;
}