#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
using namespace std;
ifstream fin("bellmanford.in");
ofstream fout("bellmanford.out");
#define MAX 50010
#define inf 1e9
#define cout fout
typedef vector<pair<int, int> > :: iterator iter;
vector <pair<int, int> > G[MAX];
int dist[MAX], ap[MAX];
int n, m, x, y, c, i, nod;
queue <int> Q;

int main()
{
    fin >> n >> m;
    while(m--)
    {
        fin >> x >> y >> c;
        G[x].push_back(make_pair(y, c));
    }
    for(i = 1 ; i <= n ; i++)
        dist[i] = inf;
    dist[1] = 0;
    Q.push(1);
    while(Q.size())
    {
        nod = Q.front();
        ap[nod]++;
        if(ap[nod] > n)
        {
            cout << "Ciclu negativ!\n";
            return 0;
        }
        Q.pop();
        for(iter it = G[nod].begin() ; it != G[nod].end() ; it++)
        {
            if(dist[it->first]> dist[nod] + it->second)
            {
                dist[it->first] = dist[nod] + it->second;
                Q.push(it->first);
            }
        }
    }
    for(i = 2 ; i <= n ; i++)
    {
        cout << dist[i] << " ";
    }
    cout << "\n";
    return 0;
}