#include <bits/stdc++.h>

using namespace std;
ifstream fin ("dijkstra.in");
ofstream fout ("dijkstra.out");
const int NMAX=25e4+5,INF=INT_MAX;
int n,m,dist[NMAX];
priority_queue < pair<int,int> > pq;
vector < pair<int,int> > G[NMAX];
bool viz[NMAX];
void citire(){
    int x,y,w;
    fin>>n>>m;
    for(int i=1;i<=n;i++)
    {
        fin>>x>>y>>w;
        G[x].push_back(make_pair(y,-w));
    }
}
void dijkstra()
{
    for(int i=2;i<=n;i++) dist[i]=INF;
    dist[1]=0;
    pq.push(make_pair(1,0));
    while(!pq.empty())
    {
        int nod=pq.top().first;
        pq.pop();
        viz[nod]=true;
        for(int i=0;i<G[nod].size();i++)
        {
            int nodd=G[nod][i].first;
            int w=G[nod][i].second;
            if(dist[nodd]>dist[nod]-w)
            {
                dist[nodd]=dist[nod]-w;
                pq.push(make_pair(nodd,-dist[nodd]));
            }
        }
    }
}
void afisare()
{
    for(int i=2;i<=n;i++)
        if(dist[i]==INF) fout<<"1 ";
    else fout<<dist[i]<<" ";
}
int main()
{
    citire();
    dijkstra();
    afisare();
    return 0;
}