#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];
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({-1*c,b});
    }
    for(int i=2; i<=n; i++)
        dist[i]=-1000000000;
    Q.push({0,1});
    while(!Q.empty())
    {
        int nod,cnod;
        nod=Q.top().second;
        cnod=Q.top().first;
        Q.pop();
        if(!viz[nod])
        {
            for(auto it:A[nod])
            {
                int nnod,cnnod;
                cnnod=it.first;
                nnod=it.second;

                    if(dist[nod]+cnnod>dist[nnod])
                    {
                        dist[nnod]=dist[nod]+cnnod;
                        Q.push({dist[nnod],nnod});
                    }

            }
            viz[nod]=1;
        }
    }
    for(int i=2; i<=n; i++)
    {
        if(dist[i]!=-1000000000)
        fout<<-1*dist[i]<<" ";
        else
            fout<<0<<" ";
    }
    return 0;
}