#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

int n, m, i, a, b, c, cost[50010], aux,freq[50010], k;
pair <int, int > pp, x;
vector < pair<int,int> > v[50010];
queue <int>q;
int main()
{
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>a>>b>>c;
        v[a].push_back(make_pair(b,c));
    }
        for(i=2;i<=n;i++)
            cost[i]=1<<30;
        q.push(1);
        while(!q.empty()){
                if(freq[q.front()]==n){
                 fout<<"Ciclu negativ!";

                   return 0;
                }
            aux=q.front();
            q.pop();
            for( i=0;i<v[aux].size();i++)
            {
                x=v[aux][i];
                if(cost[x.first]>cost[aux]+x.second)
                {
                    cost[x.first]=cost[aux]+x.second;
                    q.push(x.first);
                    freq[x.first]++;
                }

            }

        }

        for( i=2;i<=n;i++)
           {
                if(cost[i]==1<<30)
                    fout<<0<<" ";
                else
                    fout<<cost[i]<< " " ;
           }
    return 0;
}