#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[50001],D[50001];
int n,m;
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++)
        D[i]=-1000000000;
    Q.push({0,1});
    while (!Q.empty())
    {
        int c=Q.top().first;
        int nod=Q.top().second;
        Q.pop();
        for(auto it:A[nod])
        {
            int nnod=it.second;
            int cn=it.first;
            if(D[nnod]<D[nod]+cn)
            {
                D[nnod]=D[nod]+cn;
                Q.push({D[nnod],nnod});
            }
        }
    }
    for(int i=2;i<=n;i++)
    {
        fout<<D[i]<<" ";
    }
    return 0;
}