#include <iostream>
#include <fstream>
#include <vector>
#include <set>
#include <cstring>
#define dim 50005

using namespace std;

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

int INF = 0x3f3f3f3f,m,d[dim],n , i , x , nod,next_nod,y,c,l;

vector < pair < int,int > > v[dim];
set < pair < int,int > > heap;

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

    memset(d , INF , sizeof(d));

    heap.insert({0 , 1});
    d[1] = 0;
    while(not heap.empty())
    {
        nod = heap.begin() -> second; l = v[nod].size();
        heap.erase(heap.begin());
        for(i = 0; i < l; i++)
        {
            next_nod = v[nod][i].second;
            c = v[nod][i].first;
            if(d[next_nod] > d[nod] + c)
            {
                if(d[next_nod] != INF)
                    heap.erase(heap.find({d[next_nod] , next_nod}));
                d[next_nod] = d[nod] + c;
                heap.insert({d[next_nod] , next_nod});
            }
        }
    }

    for(i = 2;i <= n;i++)
        if(d[i] == INF)
        g << "0 ";
    else g << d[i] << " ";

    return 0;
}