#include <cstdio>
#include <vector>
#include <set>

FILE *fin = fopen("dijkstra.in", "r");
FILE *fout = fopen("dijkstra.out", "w");

#define MAXN 500000
#define INF 5100000000
#define MAXM 250000
std::vector <std::pair<int,int>> v[MAXM + 1];
std::multiset <std::pair<long long, int>> s;
std::vector<std::pair<int, int>>::iterator it;

long long dist[MAXN + 1];


int main()
{
    int m, n, x, y, c;
    fscanf(fin, "%d%d", &n, &m);
    for (int i = 1; i <= m; i++) {
        fscanf(fin, "%d%d%d", &x, &y, &c);
        v[x].push_back(std::make_pair(y,c));
    }
    dist[1] = 0;
    for (int i = 2; i <= n; i++) {
        dist[i] = INF;
    }
    s.insert(std::make_pair(dist[1], 1));
    while (s.empty() == 0) {
        int p = s.begin()->second;
        s.erase(s.begin());
        for (it = v[p].begin(); it != v[p].end(); it++) {
            y = it->first;
            c = it->second;
            if (dist[y] > dist[p] + c) {
                if (dist[y] != INF) {
                    s.erase(s.find(std::make_pair(dist[y], y)));
                }
                dist[y] = dist[p] + c;
                s.insert(std::make_pair(dist[y], y));
            }
        }
    }
    for (int i = 2; i <= n; i++) {
        if (dist[i] == INF)
            fprintf(fout, "0");
        else
            fprintf(fout, "%lld", dist[i]);
        fprintf(fout, " ");
    }
    return 0;
}