#include <cstdio>
#include <vector>
#include <set>
#include <algorithm>
using namespace std;
#define Max 50001
#define Inf 0xffffff
vector<pair<int,int> >g[Max];
set<int>s,v;

int n,d[Max];

void bellman(){
    int x,y;

    for(int i=2;i<=n;i++) d[i] = Inf;
    s.insert(1);
    for(int k=1;k<=n;k++)
    {
        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;
                    v.insert(y);
                }
            }
        }
        swap(s,v);
    }
    if( s.size() > 0 )printf("Ciclu negativ!"); 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;
}