#include <bits/stdc++.h>
#include <fstream>
using namespace std;
ifstream fin("bellmanford.in");
ofstream fout("bellmanford.out");

vector<pair<int,int>>graf[50005];
queue<int> q;
int dist[50005], noduri[50005];

int main()
{
    int n,m,x,y,c;
    int i;
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y>>c;
        graf[x].push_back({y,c});
    }
    for(i=2;i<=n;i++)
        dist[i]=1e9;
    noduri[1]=1;
    dist[1]=0;
    q.push(1);
    while(!q.empty())
    {
        int nodCrt=q.front();
        q.pop();
        //verif ciclu negativ
        if(noduri[nodCrt]>n){
            fout<<"Ciclu negativ!";
            return 0;}
        for(auto a:graf[nodCrt])
            if(dist[a.first]>dist[nodCrt]+a.second)
        {
            noduri[a.first]=noduri[nodCrt]+1;
            dist[a.first]=dist[nodCrt]+a.second;
            q.push(a.first);
        }
    }
    for(i=2;i<=n;i++)
        fout<<dist[i]<<" ";
    return 0;
}