using namespace std;

#include <set>
#include <map>
#include <list>
#include <deque>
#include <stack>
#include <queue>
#include <cmath>
#include <ctime>
#include <cctype>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <utility>
#include <iomanip>
#include <fstream>
#include <cstring>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>

#define oo (1<<30)
#define f first
#define s second
#define II inline
#define db double
#define ll long long
#define pb push_back
#define mp make_pair
#define Size(V) ((int)(V.size()))
#define all(V) (V).begin() , (V).end()
#define CC(V) memset((V),0,sizeof((V)))
#define CP(A,B) memcpy((A),(B),sizeof((B)))
#define FOR(i,a,b) for(int (i)=(a);(i)<=(b);++(i))
#define REP(i, N) for (int (i)=0;(i)<(int)(N);++(i))
#define FORit(it, x) for (__typeof((x).begin()) it = (x).begin(); it != (x).end(); ++it)

typedef vector<int> VI;
typedef pair<int,int> pi;
typedef pair<short int,short int> ps;
typedef vector<string> VS;
template<class T> string toString(T n) {ostringstream ost;ost<<n;ost.flush();return ost.str();}

#define N_MAX (1<<16)

int N,M;
vector< vector<pi> > V(N_MAX);
int Dist[N_MAX],Nr[N_MAX];
queue<int> Q;

void clear( std::queue<int> &q )
{
   std::queue<int> empty;
   std::swap( q, empty );
}

II int BF(int Start)
{
    clear(Q);

    memset(Dist,100,sizeof(Dist));
    CC(Nr);

    Q.push(Start);
    Dist[Start] = 0;

    for(;!Q.empty();)
    {
        int nod = Q.front();
        Q.pop();

        if(Nr[nod] > N)
            return oo;

        FORit(it,V[nod])
            if(Dist[it->f] > Dist[nod] + it->s)
            {
                //printf("# %d %d\n",nod,it->f);
                Dist[it->f] = Dist[nod] + it->s;

                Q.push(it->f);
                ++Nr[it->f];
            }
    }

    return 0;
}

II void solve()
{
    int S,D;
    V.clear();
    V.resize(N_MAX);

    S = 1;
    scanf("%d%d",&N,&M);

    int x,y,c;
    FOR(i,1,M)
    {
        scanf("%d%d%d",&x,&y,&c);
        V[x].pb( mp(y,c) );
    }

    int rez = BF(S);
    if(rez == oo)
        printf("Ciclu negativ!\n");
    else
    {
        FOR(i,2,N)
            printf("%d ",Dist[i]);
        printf("\n");
    }
}

int main()
{
    #ifndef ONLINE_JUDGE
		freopen("bellmanford.in", "r", stdin);
		freopen("bellmanford.out", "w", stdout);
	#endif

    //int T = 0;
    //scanf("%d",&T);

    //FOR(i,1,T)
        solve();

    return 0;
}