#include <bits/stdc++.h>
#define oo 1e9

using namespace std;

ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

long long n, m, d[50003], viz[50003];
vector< pair<long long, long long> > h[50003];
priority_queue< pair<long long, long long > > q;

void Citire()
{
    int i, j, x, y, c;
    fin >> n >> m;
    for (i = 1; i <= n; i++)
    {
        fin >> x >> y >> c;
        h[x].push_back({c, y});
    }
}

void Dijkstra(int P)
{
    int i, k, c;
    for (i = 1; i <= n; i++)
        d[i] = oo;
    q.push({0, P});
    d[P] = 0;
    while (!q.empty())
    {
        k = q.top().second;
        q.pop();
        if (viz[k] == 0)
        {
            viz[k] = 1;
            for (auto w : h[k])
            {
                i = w.second;
                c = w.first;
                if (d[i] > d[k] + c)
                {
                    d[i] = d[k] + c;
                    q.push({-d[i], i});
                }
            }
        }
    }
}

int main()
{
    Citire();
    Dijkstra(1);
    for (int i = 2; i <= n; i++)
        if (d[i] != oo) fout << d[i] << " ";
        else fout << "0 ";
    return 0;
}