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

using namespace std;

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

const int N_MAX = 50000;

queue <pair<int,int>> q;
vector <pair<int,int>> g[N_MAX + 1];

int dist[N_MAX + 1];
int inQueue[N_MAX + 1];
int cnt[N_MAX + 1];

int bellman_ford ( int node, int n ) {
    q.push( { 0, node } );
    cnt[node] = 1;
    dist[node] = 0;
    while ( !q.empty() ) {
        int node = q.front().second;
        int d = q.front().first;
        q.pop();
        inQueue[node] = false;
        for ( int i = 0; i < g[node].size(); i++ ) {
            if ( dist[g[node][i].second] > dist[node] + g[node][i].first ) {
                dist[g[node][i].second] = dist[node] + g[node][i].first;
                if ( !inQueue[g[node][i].second] ) {
                    q.push( { d + g[node][i].first, g[node][i].second } );
                    cnt[g[node][i].second]++;
                    inQueue[g[node][i].second] = 1;
                    if ( cnt[g[node][i].second] == n ) {
                        return 0;
                    }
                }
            }
        }
    }
    
    return 1;
}
int main() {
    
    int n, i, m, a, b, c;
    
    fin >> n >> m;
    
    for ( i = 0; i < m; i ++ ) {
        fin >> a >> b >> c;
        g[a].push_back( { c, b } );
    }
    
    for ( i = 1; i <= n; i++ )
        dist[i] = 1e9;
    
    if ( !bellman_ford ( 1, n ) )
        fout << "Ciclu negativ!";
    else
        for ( i = 2; i <= n; i ++ )
            fout << dist[i] << ' ';
    
    return 0;
}