#include <cstdio>
#include <vector>
#include <queue>
#define NMAX 50005
#define inf 2000000000
using namespace std;
vector <pair <int,int> > g[NMAX];
queue <int> q;
int cost[NMAX],exist[NMAX],repeat[NMAX];
int n,m,i,x,y,c,node,val,crt;
bool OK;
void load()
{
    scanf("%d %d",&n,&m);
    for (i=1; i<=m; i++)
    {
        scanf("%d %d %d",&x,&y,&c);
        g[x].push_back(make_pair(y,c));
    }
}

bool bellman_ford()
{
    for (i=2; i<=n; i++) cost[i]=inf;
    cost[1]=0;
    q.push(1);
    while (!q.empty())
    {
        crt=q.front();
        exist[crt]=0;
        q.pop();
        for (i=0; i<g[crt].size(); i++)
        {
            node=g[crt][i].first;
            val=g[crt][i].second;
            if(cost[crt]+val<cost[node])
            {
                if(repeat[node]==n-1) return false;
                repeat[node]++;
                cost[node]=cost[crt]+val;
                if(!exist[node])
                {
                    q.push(node);
                    exist[node]=1;
                }
            }
        }
    }
    return true;
}
int main()
{
    freopen("bellmanford.in","r",stdin);
    freopen("bellmanford.out","w",stdout);
    load();
    if (bellman_ford())
        for (i=2; i<=n; i++) printf("%d ",cost[i]);
    else printf("Ciclu negativ!");
    return 0;
}