#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define INF 0x3f3f3f3f
using namespace std;
ifstream in("dijkstra.in");
ofstream out("dijkstra.out");

queue<int>coada;
vector<pair<int, int>>graf[50005];

int d[50005];
int viz[50005];
int esteInCoada[50005];

int n,m;

void citire()
{
    in>>n>>m;
    
    for(int i=1;i<=m;i++)
    {
        int x,y,c;
        in>>x>>y>>c;
        graf[x].push_back(make_pair(y, c));
    }
    
    
}

bool bellman_ford(int s)
{
    for(int i=1;i<=n;i++)
    {
        viz[i] = 0;
        d[i] = INF;
        esteInCoada[i] = 0;
    }
    
    d[s] = 0;
    coada.push(s);
    esteInCoada[s] = 1;
    
    while(!coada.empty())
    {
        int nod_current = coada.front();
        viz[nod_current]++;
        
        if(viz[nod_current] >= n)
            return false;
        
        coada.pop();
        
        esteInCoada[nod_current] = 0;
        
        for(size_t i = 0; i < graf[nod_current].size();i++)
        {
            int vecin,cost;
            vecin = graf[nod_current][i].first;
            cost = graf[nod_current][i].second;
            
            if(d[nod_current] + cost < d[vecin])
            {
                d[vecin] = d[nod_current] + cost;
                if(!esteInCoada[vecin])
                    coada.push(vecin);
            }
        }
    }
    
    return true;
}

int main()
{
    citire();
    
    if(bellman_ford(1))
        for(int i=2;i<=n;i++)
            out<<d[i]<<" ";
    else
        out<<"Ciclu negativ!";
    
}