# include <cstring>
# include <iostream>
# include <fstream>
# include <vector>
# include <queue>
using namespace std;

# define INF 0x3f3f3f3f
# define MAXN 50010

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

int n, m;
vector<pair<int, int> > G[MAXN];
int dist[MAXN];
queue<int> coada;

void bfs()
{
    memset(dist, 0x3f, sizeof(dist));
    dist[1] = 0;
    coada.push(1);
    while (!coada.empty()) {
        int nd = coada.front();
        coada.pop();

        /*cout << nd << " : ";
        for (int i = 0; i < G[nd].size(); i++) {
            cout << G[nd][i].first << ' ';
        }
        cout << endl;*/

        for (int i = 0; i < G[nd].size(); i++) {
            if (dist[G[nd][i].first] > dist[nd] + G[nd][i].second) {
                dist[G[nd][i].first] = dist[nd] + G[nd][i].second;
                coada.push(G[nd][i].first);
            }
        }
    }

    for (int i = 2; i <= n; i++) {
        if (dist[i] == INF) {
            g << 0 << ' ';
        } else {
            g << dist[i] << ' ';
        }
    }
}

int main()
{
    f >> n >> m;
    for (int i = 1; i <= m; i++) {
        int x, y, cost;
        f >> x >> y >> cost;
        G[x].push_back(make_pair(y, cost));
    }

    bfs();

    return 0;
}