#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define pb push_back
#define mp make_pair
/// http://www.spoj.com/problems/ARBITRAG/
using namespace std;
ifstream f("bellmanford.in");
ofstream g("bellmanford.out");
int n,v[50005],m,a,b,c,start,finish,cost,cycle[50005],inf=(1<<30);
vector< pair<int,int> >vecini[50005];
queue<int> q; bool ok=true;

void BF(int x)
{
    q.push(x);
    while(!q.empty())
    {
        start=q.front(); q.pop();
        for(int i=0;i<vecini[start].size();++i)
        {
            finish=vecini[start][i].first;
            cost=vecini[start][i].second+v[start];
            if(cost<v[finish] || cycle[finish]==0)
            {
                v[finish]=cost;
                cycle[finish]++;
                if(cycle[finish]==n)
                {
                    g<<"Ciclu negativ!"; ok=false; return;
                }
                q.push(finish);
            }
        }
    }
}

int main()
{
    f>>n>>m;
    for(int i=1;i<=m;++i)
    {
        f>>a>>b>>c;
        vecini[a].pb(mp(b,c));
        vecini[b].pb(mp(a,c));
    }
    BF(1);
    if(ok)
    {
        for(int i=2;i<=n;++i) g<<v[i]<<' ';
    }
    return 0;
}