#include <bits/stdc++.h>
#define dim  50005

using namespace std;

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

vector < pair < int,int > > v[dim];
set < pair < int, int > > heap;
int INF = 0x3f3f3f3f , n , m, x , y , c , d[dim] , nod , l , i, next_nod, cost;

void read()
{
    f >> n >> m;

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

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

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

            if(d[next_nod] > cost + c)
            {
                if(d[next_nod] != INF)
                    heap.erase(heap.find({d[next_nod] , next_nod}));
                d[next_nod] = c + cost;
                heap.insert({d[next_nod] , next_nod});
            }
        }
    }
}

int main()
{
    read();
    Dijkstra();

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

    return 0;
}