#include <bits/stdc++.h>

using namespace std;
ifstream in("bellmanford.in");
ofstream out("bellmanford.out");
bool viz[50002];
int dist[50002];
struct arc
{
    int x, c;
};
vector < arc > v[50002];
queue < int > q;
int n,m,x,y,z;
int main()
{
    in>>n>>m;
    for(int i=1; i<=m; i++)
    {
        in>>x>>y>>z;
        v[x].push_back({y,z});
    }
    for(int i=1; i<=n; i++)
        dist[i]=INT_MAX;
    dist[1]=0;
    viz[1]=1;
    q.push(1);
    while(!q.empty())
    {
        int i=q.front();
        q.pop();
        m=v[i].size();
        for(int k=0; k<m; k++)
        {
            int j=v[i].at(k).x;
            int c=v[i].at(k).c;
            if(viz[j] && c<0)
            {
                out<<"Ciclu negativ!";
                return 0;
            }
            if(dist[j]>dist[i]+c)
            {
                viz[j]=1;
                dist[j]=dist[i]+c;
                q.push(j);
            }
        }
    }
    for(int i=2; i<=n; i++)
        out<<dist[i]<<' ';
    return 0;
}