#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
vector <pair <int,int> > A[250001];
priority_queue <pair<int,int> > Q;
int n,m;
int dist[50001];
int main()
{
    fin>>n>>m;
    for(int i=1;i<=n;i++)
    {
        int a,b,c;
        fin>>a>>b>>c;
        A[a].push_back({-1*c,b});
    }
    Q.push({0,1});
    while(!Q.empty())
    {
        int nod,cnod;
        nod=Q.top().second;
        cnod=Q.top().first;
        Q.pop();
        for(auto it:A[nod])
        {
            int nnod,cnnod;
            cnnod=it.first;
            nnod=it.second;
            if(dist[nnod]==0 || dist[nod]+cnnod>dist[nnod])
            {
                dist[nnod]=dist[nod]+cnnod;
                Q.push({cnnod,nnod});
            }
        }
    }
    for(int i=2;i<=n;i++)
    {
        fout<<-1*dist[i]<<" ";
    }
    return 0;
}