#include<fstream>
#include<vector>
#include<queue>
#define inf 1000000000
using namespace std;
ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");
priority_queue<pair<int,int>>Q;
vector<vector<pair<int,int>> >mu;
int n,m,x,y,cost[50002],c;
int main()
{
    cin>>n>>m;
    mu.resize(n+1);
    for(int i=1; i<=n; i++)
    {
        cin>>x>>y>>c;
        mu[x].push_back(make_pair(c,y));
    }
    for(int i=1; i<=n; i++)
        cost[i]=inf;
    Q.push(make_pair(0,1));
    cost[1]=0;
    while(Q.empty()==0)
    {
        int nod=Q.top().second;
        //int c=Q.top().first;
        Q.pop();
        for(int i=0; i<mu[nod].size(); i++)
            if(cost[nod]+mu[nod][i].first<cost[mu[nod][i].second])
            {
                cost[mu[nod][i].second]=cost[nod]+mu[nod][i].first;
                Q.push(make_pair(-cost[mu[nod][i].second],mu[nod][i].second));
            }
    }
    for(int i=2; i<=n; i++)
    {
        if(cost[i]!=inf)
            cout<<cost[i]<<' ';
        else
            cout<<0<<' ';
    }
}