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

#define MAXN 50000
#define INF 1000000000000

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

std::vector <std::pair<int, int>> v[MAXN + 1];
std::multiset <std::pair<long long, int>> s;

long long dist[MAXN + 1];

int main()
{
    int n, m, 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(0, 1));
    while (s.empty() == 0) {
        int p = s.begin()->second;
        s.erase(s.begin());
        int siz = v[p].size();
        for (int i = 0; i < siz; i++) {
            int y = v[p][i].first;
            int c = v[p][i].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)
            dist[i] = 0;
        fprintf(fout, "%lld ", dist[i]);
    }
    return 0;
}