#include <bits/stdc++.h>


using namespace std;
ifstream f("bellmanford.in");
ofstream g("bellmanford.out");

vector<pair<int,int> > v[50001];
priority_queue<pair<int,int>,vector<pair<int,int> >,greater<pair<int,int> > >h;
int d[50001],n,m,a,b,c,x,i;
int w[50001];
int main()
{
    f>>n>>m;
    for(i=1; i<=m; i++)
    {
        f>>a>>b>>c;
        v[a].push_back(make_pair(c,b));
    }
    for(i=1;i<=n;i++)d[i]=1000000000;
    d[1]=0;
    h.push(make_pair(0,1));
    while(!h.empty())
    {
        x=h.top().second;
        h.pop();
        for(i=0; i<v[x].size(); i++)
        {
            if(d[x]+v[x][i].first<d[v[x][i].second])
            {
                w[v[x][i].second]++;
                d[v[x][i].second]=d[x]+v[x][i].first;
                h.push(make_pair(d[v[x][i].second],v[x][i].second));
                if(w[v[x][i].second]==n)
                {
                    g<<"Ciclu negativ!";
                    return 0;
                }
            }
        }
    }
    for(i=2; i<=n; i++)g<<d[i]<<" ";
    return 0;
}