#include <fstream>
#include <vector>
#include <queue>
#include <bitset>

using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
int n,m,nod,cost,a,b,c,d[50010];
vector <pair<int,int>> v[50010];
priority_queue <pair<int,int>> p;
bitset<50010> viz;
int main()
{
    f>>n>>m;
    for(;m;m--)
    {
        f>>a>>b>>c;
        v[a].push_back(make_pair(-c,b));
    }
    for(int i=2;i<=n;i++)
        d[i]=-500000000;
    p.push(make_pair(0,1));
    while(p.size())
    {
        nod=p.top().second;
        cost=p.top().first;
        p.pop();
        if(viz[nod])continue;
        viz[nod]=1;
        for(auto it:v[nod])
            if(d[nod]+it.first>d[it.second])
            {
                d[it.second]=d[nod]+it.first;
                p.push(make_pair(d[it.second],it.second));
            }
    }
    for(int i=2;i<=n;i++)
        if(d[i]>-500000000)
            g<<-d[i]<<' ';
        else g<<"0 ";
    return 0;
}