#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
using namespace std;
ifstream fin("bellmanford.in");
ofstream fout("bellmanford.out");
const int Nmax=50005;
pair<long long,long long> viz[Nmax];
long long viz2[Nmax],sol[Nmax];
vector<pair<long long,long long>>v[Nmax];
queue<pair<long long,long long>>q;
priority_queue<pair<long long,long long>> pq;
int main()
{
    int n,m;
    fin>>n>>m;
    long long x,y,c;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y>>c;
        v[x].push_back({y,c});
    }
    q.push({1,0});
    while(!q.empty())
    {
        long long nod=q.front().first;
        long long cost=q.front().second;
        q.pop();
        for(int i=0;i<v[nod].size();i++)
        {
            long long next=v[nod][i].first;
            long long ct=v[nod][i].second;
            if(viz[next].first==0 || viz[next].second>ct+cost)
            {
                viz[next].first++;
                viz[next].second=ct+cost;
                q.push({next,ct+cost});
            }
            if(viz[next].first>m)
            {
                fout<<"Ciclu negativ!";
                return 0;
            }
        }
    }
    pq.push({0,1});
    while(!pq.empty())
    {
        long long nod=pq.top().second;
        long long cost=pq.top().first;
        pq.pop();
        if(viz2[nod]==0)
        {
            sol[nod]=-cost;
            viz2[nod]=1;
        }
        else continue;
        for(int i=0;i<v[nod].size();i++)
        {
            long long next=v[nod][i].first;
            long long ct=v[nod][i].second;
            if(viz2[next]==0)
            {
                pq.push({cost-ct,next});
            }
        }
    }
    for(int i=2;i<=n;i++)
    {
        fout<<sol[i]<<' ';
    }
    return 0;
}