#include <bits/stdc++.h>
#define int long long
#define pii pair <int,int>

using namespace std;

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

const int nmax = 5e4 + 5;
const int inf = 2e9;
int n, m, dist[nmax];

vector<pii > gr[nmax];
priority_queue<pii, vector<pii >, greater<pii > > pq;

void init()
{
    for (int i = 1; i <= n; i++)
        dist[i] = inf;

    dist[1] = 0;
    pq.push({0, 1});
}

void dijkstra()
{
    init();

    while (!pq.empty())
    {
        auto [d,u] = pq.top();
        pq.pop();

        if (d != dist[u]) continue;

        for (auto [w,v]: gr[u])
        {
            if (dist[u] + w < dist[v])
            {
                dist[v] = dist[u] + w;
                pq.push({dist[v], v});
            }
        }
    }
}

signed main()
{
    f >> n >> m;

    for (int i = 1; i <= m; i++)
    {
        int x, y, c;
        f >> x >> y >> c;
        gr[x].push_back({c, y});
    }

    dijkstra();

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