#include <fstream>
#include <vector>
#include <queue>
#define inf 1<<30
#define MAX 50001
using namespace std;
ifstream f("bellmanford.in");
ofstream g("bellmanford.out");
vector<pair <int,int> > a[MAX];
queue<int> q;
int n,m;
int d[MAX];
int uz[MAX];
bool e_pus[MAX];
bool ciclu_negativ=false;
void citire(){
    int i,x,y,z;
    f>>n>>m;
    for(i=1 ; i<=m ; ++i)
    {
        f>>x>>y>>z;
        a[x].push_back(make_pair(y,z));
    }
}
void BF(){
    for(int i=1 ; i<=n ; ++i)
        d[i]=inf;
    q.push(1);
    e_pus[1]=true;
    d[1]=0;
    int x;
    while(!q.empty())
    {
        x=q.front();
        q.pop();
        uz[x]++;
        if(uz[x]==n)
        {
            ciclu_negativ=true;
            return ;
        }
        vector<pair <int,int> >::iterator it;
        for(it=a[x].begin() ; it!=a[x].end() ; ++it)
        {
            int vec=it->first;
            int cost=it->second;
            if(d[vec]>d[x]+cost)
            {
                d[vec]=d[x]+cost;
                if(!e_pus[vec])
                {
                    e_pus[vec]=true;
                    q.push(vec);
                }
            }
        }
        e_pus[x]=false;
    }
}
int main()
{
    citire();
    BF();
    if(ciclu_negativ)
        g<<"Ciclu negativ!";
    else
    {
        for(int i=2 ; i<=n ; ++i)
            g<<d[i]<<" ";
    }
    return 0;
}