#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

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

const int NMAX = 50005;
const int INF = (1<<30);

vector <pair <int,int> > Graf[NMAX];
queue <int> my_queue;

int n,m;
int sol[NMAX];

void citire()
{
    in>>n>>m;
    for(int i=1; i<=n; i++)
    {
        int x,y,z;
        in>>x>>y>>z;
        Graf[x].push_back(make_pair(y,z));
    }
}

void dijkstra(int starting_node)
{
    my_queue.push(starting_node);
    while(my_queue.empty()==0)
    {
        int c_node = my_queue.front();
        my_queue.pop();
        for(unsigned int i=0; i<Graf[c_node].size(); i++)
        {
            if(sol[c_node]+Graf[c_node][i].second<sol[Graf[c_node][i].first])
            {
                sol[Graf[c_node][i].first]=sol[c_node]+Graf[c_node][i].second;
                my_queue.push(Graf[c_node][i].first);
            }
        }
    }
}

void solve()
{
    for(int i=2; i<=n; i++)
    {
        sol[i]=INF;
    }
    dijkstra(1);
}

void print()
{
    for(int i=2; i<=n; i++)
    {
        if(sol[i]==INF)
        {
            out<<0<<" ";
        }
        else
        {
            out<<sol[i]<<" ";
        }
    }
}


int main()
{
    citire();
    solve();
    print();
}