#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

int n,m;
vector <pair <int,int> >V[1000001];
priority_queue <pair <int,int> >Q;
int D[1000001];
int main()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int a,b,c;
        fin>>a>>b>>c;
        V[a].push_back({-1*c,b});
    }
    for(int i=2;i<=n;i++)
        D[i]=-1000000000;
    Q.push({0,1});
    while(!Q.empty())
    {
        int cost=Q.top().first;
        int nod=Q.top().second;
        Q.pop();
        for(auto it:V[nod])
        {
            int nnod=it.second;
            int cnod=it.first;
            if(D[nnod]<D[nod]+cnod)
            {
                D[nnod]=D[nod]+cnod;
                Q.push({D[nod]+cnod,nnod});
            }
        }
    }
    for(int i=2;i<=n;i++)
    {
        if(D[i]==-1000000000)
            fout<<"0 ";
        else
        fout<<-D[i]<<" ";
    }
    return 0;
}