#include <stdio.h>
#include <queue>
#include <vector>
#include <stdlib.h>
#define inf 10000000
using namespace std;
int n,m,i,x,y,z,d[50001],f[50001];
bool o[50001];
vector<pair<int,int> > G[50001];
queue<int> Q;
void bellmanford()
{
    int i,x;
    for (i=2;i<=n;i++) d[i]=inf;
    Q.push(1); o[1]=1;
    while (!Q.empty())
    {
        x=Q.front();
        Q.pop();
        o[x]=0;
        for (i=0;i<G[x].size();i++)
        {
            y=G[x][i].first;
            if (d[y]>d[x]+G[x][i].second)
            {
                d[y]=d[x]+G[x][i].second;
                if (!o[y])
                {
                    Q.push(y);
                    o[y]=1;
                    f[y]++;
                    if (f[y]==n+1)
                    {
                        printf("Ciclu negativ!");
                        exit(0);
                    }
                }
            }
        }
    }
}
int main()
{
    freopen ("bellmanford.in","r",stdin);
    freopen ("bellmanford.out","w",stdout);
    scanf("%i%i",&n,&m);
    for (i=1;i<=m;i++)
    {
        scanf("%i%i%i",&x,&y,&z);
        G[x].push_back(make_pair(y,z));
    }
    bellmanford();
    for (i=2;i<=n;i++) printf("%i ",d[i]);
    fclose(stdin);
    fclose(stdout);
    return 0;
}