#include<cstdio>
#include<vector>
#include<queue>
#define pp pair<int,int>
#define ff first
#define ss second
#define nmax 50001
#define inf 10000000000000LL
using namespace std;
vector <pp> v[nmax];
queue <int> Q;
bool viz[nmax];
int n,m,nr[nmax],d[nmax];
bool BellmanFord(){
    pp aux;
    int i,curr;
    Q.push(1);viz[1]=1;
    for(i=2;i<=n;i++)
        d[i]=inf;
    while(!Q.empty()){
        curr=Q.front();Q.pop();viz[curr]=0;
        nr[curr]++;
        if(nr[curr]>=n)
            return 0;
        for(unsigned j=0;j<v[curr].size();j++){
            aux=v[curr][j];
            if(d[curr]+aux.ss<d[aux.ff]){
                d[aux.ff]=d[curr]+aux.ss;
                if(!viz[aux.ff]){
                    Q.push(aux.ff);
                    viz[aux.ff]=1;
                }
            }
        }
    }
    return 1;
}
int main(){
    int x,y,c,i;
    freopen("bellmanford.in","r",stdin);
    scanf("%d%d",&n,&m);
    for(i=1;i<=m;i++){
        scanf("%d%d%d",&x,&y,&c);
        v[x].push_back(make_pair(y,c));
    }
    fclose(stdin);
    bool ok=BellmanFord();
    freopen("bellmanford.out","w",stdout);
    if(!ok)
        printf("Ciclu negativ!\n");
    else
        for(i=2;i<=n;i++)
            printf("%d ",d[i]);
    return 0;
}