#include <fstream>
#include <queue>
#include <vector>
using namespace std;
ifstream f("bellmanford.in");
ofstream g("bellmanford.out");
vector < pair <int,int> > a[50010];
queue <int> q;
pair <int,int> per;
int ok=0,n,m,i,j,k,x,y,z,nr[50010],d[50010],v[50010];
int main()
{
    f>>n>>m;
    for(i=1;i<=n;i++)
    {
        f>>x>>y>>z;
        a[x].push_back(pair<int,int>(y,z));
        nr[x]++;
    }
    for(i=1;i<=n;i++)
        d[i]=1000000005;
    d[1]=0;
    q.push(1);
    while(!q.empty())
    {
        x=q.front();
        q.pop();
        for(vector<pair<int,int> >::iterator it=a[x].begin();it!=a[x].end();it++)
        {
            per=*it;
            if(d[x]+per.second<d[per.first])
            {
                d[per.first]=d[x]+per.second;
                q.push(per.first);
                v[per.first]++;
                if(v[per.first]>n)
                {
                    g<<"Ciclu negativ!";
                    return 0;
                }
            }
        }
    }
    for(i=2;i<=n;i++)
        g<<d[i]<<" ";
    g<<'\n';
    return 0;
}