#include <bits/stdc++.h>
#define Nmax 50005
#define INF 1e8
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");

int n, m, dist[Nmax];
vector < pair <int, int> > G[Nmax];

void init()
{
    for (int i = 2; i <= n; ++i)
        dist[i] = INF;
}

void read()
{
    f >> n >> m;
    init();
    int x, y, c;
    for (int i = 1; i <= m; ++i) {
        f >> x >> y >> c;
        G[x].push_back({y, c});
    }
}

void dijkstra(int start)
{
    priority_queue < pair < int, int>, vector < pair <int, int> >, greater < pair <int, int> > > Q;
    Q.push({0, start});
    dist[start] = 0;
    while (!Q.empty()) {
        int node = Q.top().second;
        int c = Q.top().first;
        Q.pop();

        if (c != dist[node])
            continue;
        vector <pair <int, int> > :: iterator it;
        for (it = G[node].begin(); it != G[node].end(); ++it) {
            int newNode = (*it).first;
            int weight = (*it).second;
            if (dist[newNode] > weight + dist[node]) {
                dist[newNode] = weight + dist[node];
                Q.push({dist[newNode], newNode});
            }
        }

    }
}

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

int main()
{
    read();
    dijkstra(1);
    show();
    return 0;
}