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

vector<pair<int,int> > g[MAX];
set<int>s,v;
int n,d[MAX];

void bellman(){
    int x,y;
    bool ciclu;
    for(int i=1;i<=n;i++) d[i] = INF;
    d[1] = 0;
    s.insert(1);

    for(int i=1;i<=n;i++)
    {
        ciclu = 0;
        while( s.size() > 0 )
        {
            x = *s.begin();
            s.erase(s.begin());
            for(int i=0;i<g[x].size();i++)
            {
                y = g[x][i].first;
                if( d[y] > d[x] + g[x][i].second )
                {
                    d[y] = d[x] + g[x][i].second;
                    ciclu = 1;
                    v.insert(y);
                }
            }
        }
        swap(s,v);
    }
    if( ciclu )printf("Ciclu negativ!\n"); else
    for(int i=2;i<=n;i++)printf("%d ",d[i]);
}

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