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

using namespace std;

priority_queue< pair<int, int> > q;
vector< pair<int, int> > L[50003];
int viz[50003], d[50003], n, m;

void Citire()
{
    int cost, x, y;
    ifstream fin("dijkstra.in");
    fin >> n >> m;
    for(int i = 1; i <= m; ++i)
    {
        fin >> x >> y >> cost;
        L[x].push_back({y, cost});
    }
    fin.close();
}

void Rezolvare()
{
    int i, k, cost, x, y;
    unsigned int j;
    for(i = 2; i <= n; i++) d[i] = oo;
    q.push({0, 1});
    while(!q.empty())
    {
        k = q.top().second;
        q.pop();
        if(!viz[k])
        {
            viz[k] = 1;
            for(j = 0; j < L[k].size(); ++j)
            {
                i = L[k][j].first;
                cost = L[k][j].second;
                if(d[i] > d[k] + cost)
                {
                    d[i] = d[k] + cost;
                    q.push({-d[i], i});
                }
            }
        }
    }
}

void Afisare()
{
    ofstream fout("dijkstra.out");
    int i;
    for(i = 2; i <= n; ++i)
        if(d[i] != oo) fout << d[i] << " ";
        else fout << "0 ";
    fout.close();
}

int main()
{
    Citire();
    Rezolvare();
    Afisare();
    return 0;
}