#include <fstream>
#define dim 50002
#include <vector>
#include <queue>
#define inf 0x3f3f3f3f
using namespace std;
ifstream cin("bellmanford.in");
ofstream cout("bellmanford.out");

int n,m;
int incoada[dim],d[dim],cnt[dim];
vector<pair<int,int>>V[dim];
queue<int>Q;

void bellman(){
    for(int i=2;i<=n;++i) d[i]=inf;
    incoada[1]=1;
    Q.push(1);
    
    while(!Q.empty()){
        int nod=Q.front();
        incoada[nod]=0;
        Q.pop();
        
        for(auto vec:V[nod]){
            int vecin=vec.first;
            int cost=vec.second;
            if(d[vecin]>d[nod]+cost){
                d[vecin]=d[nod]+cost;
                if(!incoada[vecin]){
                    Q.push(vecin);
                    incoada[vecin]=1;
                    cnt[vecin]++;
                    if(cnt[vecin]>n-1){
                        cout<<"Ciclu negativ!";
                        exit(0);
                    }
                }
            }
        }
        
    }
}

int main()
{
    cin>>n>>m;
    for(int i=1;i<=m;++i){
        int a,b,c;
        cin>>a>>b>>c;
        V[a].push_back({b,c});
    }
    
    bellman();
    
    for(int i=2;i<=n;++i)
        cout<<d[i]<<" ";
    
    return 0;
}