#include <cstdio>

#include <iostream>
#include <queue>
#include <vector>

using namespace std;

const int MAXN = 50100;
const int INF = (int)(1e9 + 7);

int n, m;
int d[MAXN];
priority_queue<pair<int, int> > heap;
vector<int> G[MAXN], C[MAXN];

void dijkstra()
{
    for (int i = 2; i <= n; ++i) d[i] = INF;
    heap.push(make_pair(0, 1));
    while (!heap.empty()) {
        int val = heap.top().first;
        int x = heap.top().second;
        heap.pop();
        for (int i = 0; i < G[x].size(); ++i)
            if (d[G[x][i]] > val + C[x][i]) {
                d[G[x][i]] = val + C[x][i];
                heap.push(make_pair(d[G[x][i]], G[x][i]));
            }
    }
}

int main()
{
    freopen("dijkstra.in", "r", stdin);
    freopen("dijkstra.out", "w", stdout);

    cin >> n >> m;
    for (int i = 1; i <= m; ++i) {
        int a, b, c;
        cin >> a >> b >> c;
        G[a].push_back(b);
        C[a].push_back(c);
    }
    dijkstra();

    for (int i = 2; i <= n; ++i)
        if (d[i] >= INF) cout << 0 << " ";
        else cout << d[i] << " ";
    cout << "\n";

    return 0;
}