#include <iostream>
#include <fstream>
#include <cstring>
#include <type_traits>
#include <ctype.h>
#include <cstdio>
#include <vector>
#include <limits>

using namespace std;

ofstream g("bellmanford.out");

const int INF = numeric_limits<int>::max()/4;

class InParser{
    private:
        FILE *file_in;
        char *buff;
        int ebp;

        int read_ch(){
            ++ebp;
            if(ebp == 4096){
                ebp = 0;
                fread(buff, 1, 4096, file_in);
            }
            return buff[ebp];
        }

    public:
        InParser(const char* file_name){
            file_in = fopen(file_name, "r");
            buff = new char[4096];
            ebp = 4095;
        }

        template<typename T, typename = typename enable_if<is_integral<T>::value>::type>
        InParser& operator>>(T& n){
            char ch;
            while(!isdigit(ch = read_ch()) && ch != '-');

            long long sgn = 1;
            long long acc;

            if(ch == '-'){
                sgn = -1;
                acc = 0;
            }
            else{
                acc = ch - '0';
            }
            
            while(isdigit(ch = read_ch())){
                acc = acc * 10 + (ch - '0');
            }

            n = static_cast<T>(acc * sgn);
            return *this;

        }

        ~InParser(){
            fclose(file_in);
            delete[] buff;
        }
};


int n,m,x,y,c;

vector<int> bellman_ford(int n, const vector<pair<int,int>> adj[], int start,int& flag){

    vector<int> dist(n+1,INF);
    dist[start] = 0;

    for(int i=0; i<n; i++){
        bool changed = false;
        
        for(int u = 1; u <= n; u++){
            if(dist[u] == INF)
                continue;

            for(auto [v,wt]: adj[u]){
                if(dist[u] + wt < dist[v]){
                    if(i == n -1){
                        flag = -1;
                    }
                    dist[v] = dist[u] + wt;
                    changed = true;
                }
            }
        }

        if(changed == false){
            break;
        }
    }
    return dist;
}



int main(){
    InParser fin("bellmanford.in");

    fin >> n >> m;

    vector<pair<int,int>> adj[n+1];

    for(int i=1; i<=m; i++){
        fin >> x >> y >> c;
        adj[x].push_back(make_pair(y,c));
    }

    int src = 1;
    int flag = 0;
    vector<int> dist = bellman_ford(n,adj,src,flag);

    if(flag == -1){
        g << "Ciclu negativ!";
    }
    else{
        for(int i=2; i<=n; i++){
            g << dist[i] << " ";
        }
    }


    return 0;
}