#include <cstdio>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
#define MAX 50005
#define INF 0xffffff

vector<pair<int,int> >g[MAX];
queue<int>q,v;
int n,d[MAX];

void bellman(){
    int x,y,c;
    for(int i=2;i<=n;i++)d[i]=INF;
    q.push(1);
    for(int i=1;i<=n;i++)
    {
        while(q.size()>0)
        {
            x=q.front();
            for(int j=0;j<g[x].size();j++)
            {
                y=g[x][j].first;
                c=g[x][j].second;
                if(d[y]>d[x]+c)
                {
                    d[y]=d[x]+c;
                    v.push(y);
                }
            }
            q.pop();
        }
        swap(q,v);
    }
    if(q.size()>0)printf("Ciclu negativ!\n"); else
    for(int i=2;i<=n;i++)printf("%d ",d[i]);
}

int main(){
    int m,x,y,z;
    freopen("bellmanford.in","r",stdin);
    freopen("bellmanford.out","w",stdout);
        scanf("%d %d",&n,&m);
        while(m--)
        {
            scanf("%d %d %d",&x,&y,&z);
            g[x].push_back(make_pair(y,z));
        }
    bellman();
    return 0;
}