#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
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];
bool VIZ[50001];
int main()
{
    fin>>n>>m;
    for(int i=1; i<=m; i++)
    {
        int a,b,c;
        fin>>a>>b>>c;
        A[a].push_back({-c,b});
    }
    for(int i=2; i<=n; i++)
    DIST[i]=-1000000001;
    Q.push({0,1});

    while(!Q.empty())
    {
        int cnod=Q.top().first;
        int nod=Q.top().second;
////        if(DIST[nod]!=cnod)
////            continue;
        Q.pop();
        if(!VIZ[nod])
        {
            for(auto it:A[nod])
            {
                int nnod=it.second;
                int ncnod=it.first;
                if(DIST[nod]+ncnod>DIST[nnod])
                {
                    DIST[nnod]=DIST[nod]+it.first;
                    Q.push({DIST[nnod],nnod});
                }
            }
            VIZ[nod]=1;
        }
    }
    for(int i=2; i<=n; i++)
    {
        if(DIST[i]==-1000000001)
        {
            fout<<0<<" ";
        }
        else
            fout<<-DIST[i]<<" ";
    }
    return 0;
}