#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <queue>
#define NMAX 50000
#define MMAX 250000
#define INF  100000000
using namespace std;
ifstream in("dijkstra.in");
ofstream out("dijkstra.out");

struct edge
{
    int e,c;
};
vector <edge> a[MMAX+5];
queue <int> q;
long long n,m,p,nr_ori[NMAX+5],cost[NMAX+5];
bool viz[NMAX+5];

bool BellmanFord()
{
    int i,fr,nod;
    q.push(p);
    while(!q.empty())
    {
        fr=q.front();
        q.pop();
        viz[fr]=0;
        for(i=0;i<a[fr].size();i++)
        {
            nod=a[fr][i].e;
            if(cost[nod]>cost[fr]+a[fr][i].c)
            {
                cost[nod]=cost[fr]+a[fr][i].c;
                if(!viz[nod])
                {
                    q.push(nod);
                    viz[nod]=1;
                    if(++nr_ori[nod]>n)
                    {
                        out<<"Ciclu negativ!";
                        return false;
                    }
                }
            }
        }
    }
    return true;
}

int main()
{
    int i,x;
    unsigned int j;
    edge y;

    in>>n>>m;
    p=1; /// nodul din care incep drumurile e 1;
    for(i=1;i<=m;i++)
    {
        in>>x>>y.e>>y.c;
        a[x].push_back(y);
    }

    for(i=1;i<=n;i++)
        cost[i]=INF;
    cost[p]=0;
    viz[p]=1;

    if(BellmanFord())
        for(i=2;i<=n;i++)
        {
            if(cost[i]==INF)
                cost[i]=-1;
            out<<cost[i]<<' ';
        }
    return 0;
}