#include <bits/stdc++.h>

using namespace std;

ifstream fin("bellmanford.in");
ofstream fout("bellmanford.out");

const int NMAX = 50005;
const int INF = (1<<29);

int dist[NMAX],frecv[NMAX];
vector < pair<int,int> > v[NMAX];
queue < pair<int,int> > q;

int main()
{
    int n,m,x,y,cost;
    fin >> n >> m;
    for(int i=1;i<=m;i++)
    {
        fin >> x >> y >> cost;
        v[x].push_back({y,cost});
    }
    for(int i=0;i<=n+1;i++) dist[i]=INF;
    dist[1]=0;
    q.push({1,0});
    while(!q.empty())
    {
        int nod=q.front().first;
        int cost=q.front().second;
        q.pop();
        if(frecv[nod]>=n){
            fout << "Ciclu negativ!";
            return 0;
        }
        frecv[nod]++;
        for(int i=0;i<v[nod].size();i++)
        {
            int vecin=v[nod][i].first;
            int cost_vecin=v[nod][i].second;
            if(dist[vecin]>dist[nod]+cost_vecin)
            {
                dist[vecin]=dist[nod]+cost_vecin;
                q.push({vecin,dist[vecin]});
            }
        }
    }
    for(int i=2;i<=n;i++)
        fout << dist[i] << ' ';
    return 0;
}