#include<stdio.h>
#include<vector>
#include<queue>
using namespace std;

const int maxn=50015,inf=999999999;
int n,m;
int d[maxn],uz[maxn],nr[maxn];
vector <pair <int,int> > l[maxn];

void cit()
{
    int i;
    int a,b,c;

    scanf("%d%d",&n,&m);
    for(i=1;i<=m;i++)
    {
        scanf("%d%d%d",&a,&b,&c);
        l[a].push_back(make_pair(b,c));

    }
    for(i=1;i<=n;i++)
        d[i]=inf;
    d[1]=0;
}

int bellman()
{
    int k;
    queue <int> q;

    q.push(1); uz[1]=1;nr[1]=1;
    while(!q.empty())
    {
        k=q.front();
        for(unsigned int i=0;i<l[k].size();i++)
            if(l[k][i].second+d[k]<d[l[k][i].first])
            {
                d[l[k][i].first]=l[k][i].second+d[k];
                if(uz[l[k][i].first]==0)
                {
                    q.push(l[k][i].first);
                    uz[l[k][i].first]=1;
                    nr[l[k][i].first]++;
                    if(nr[l[k][i].first]>n) return 0;
                }
            }
        uz[k]=0;
        q.pop();
    }
    return 1;
}

int verif()
{
    int i;
    for(i=1;i<=n;i++)
        for(unsigned int j=0;j<l[i].size();j++)
            if(uz[l[i][j].first]==0)
            {
                if(d[i]+l[i][j].second<d[l[i][j].first])
                    return 1;
                uz[l[i][j].first]=1;
            }
    return 0;
}

void afis()
{
    int i;
    for(i=2;i<=n;i++)
        printf("%d ",d[i]);

}

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

    cit();
    if(bellman()) afis();
    else
        printf("Ciclu negativ!");

    fclose(stdin);
    fclose(stdout);
    return 0;
}