#include <fstream>
#include <vector>
#include <queue>
using namespace std;
const int MAX = 50001, INF = 250000001;
vector <pair<int, int> > gr[MAX];
queue <int> q;
int n, m, d[MAX], cate[MAX];
int bellman(){
    for(int i=2; i<=n; i++) d[i] = INF;
    q.push(1);
    while(!q.empty()){
        int nod = q.front();
        q.pop();
        for(unsigned i=0; i<gr[nod].size(); i++){
            int fiu = gr[nod][i].first;
            int w = gr[nod][i].second;
            if(d[fiu]>d[nod] + w){
                d[fiu] = d[nod] + w;
                q.push(fiu);
                cate[fiu]++;
                if(cate[fiu]>n) return 0;
            }
        }
    }
    return 1;
}
int main()
{
    ifstream fin("bellmanford.in");
    ofstream fout("bellmanford.out");
    fin>>n>>m;
    for(int i=1; i<=m; i++){
        int u, v, w;
        fin>>u>>v>>w;
        gr[u].push_back({v, w});
    }
    int ans = bellman();
    if(ans==0)
        fout<<"Ciclu negativ!";
    else
        for(int i=2; i<=n; i++)
            fout<<d[i]<<' ';
    return 0;
}