#include <fstream>
#include <vector>
#include <queue>

#define pii pair<int,int>

using namespace std;

int n, m, x, y, c;

vector<vector<pii>> arches;
vector<int> nr_visits, distances;
vector<bool> visited;
queue<int> q;

bool BellmanFord(){
    distances[0] = 0;
    q.push(0);
    nr_visits[0]++;
    while(!q.empty()){
        int current = q.front();
        q.pop();
        visited[current] = false;
        for(auto itr: arches[current])
            if(distances[current] + itr.second < distances[itr.first]) {
                distances[itr.first] = distances[current] + itr.second;
                if(!visited[itr.first]){
                    q.push(itr.first);
                    visited[itr.first] = true;
                    /// ciclu infinit
                    if(++nr_visits[itr.first]>n)
                        return false;
                }
            }
    }
    return true;
}

int main(){
    ifstream fin("bellmanford.in");
    ofstream fout("bellmanford.out");

    fin>>n>>m;
    arches.resize(n+1);
    nr_visits.resize(n+1, 0);
    visited.resize(n+1, false);
    distances.resize(n, 2e9);
    for(int i=0;i<m;i++){
        fin>>x>>y>>c;
        arches[x-1].push_back({y-1, c});
    }

    if(!BellmanFord()){
        fout<<"Ciclu negativ!";
        return 0;
    }

    for(int i=1;i<n;++i)
        fout<<distances[i]<<" ";

    return 0;
}