#include<bits/stdc++.h>
using namespace std;

int n,m,x,y,z;
const int inf=INT_MAX;
const int maxN=50005;
deque<int> q;
int dp[maxN],used[maxN];
bool inQueue[maxN];
vector<pair<int,int> > v[maxN];
int main()
{
    freopen("bellmanford.in","r",stdin);
    freopen("bellmanford.out","w",stdout);

    scanf("%d%d",&n,&m);

    for(int i=1;i<=m;i++)
    {
        scanf("%d%d%d",&x,&y,&z);
        v[x].push_back(make_pair(y,z));
       // v[y].push_back(make_pair(x,z));
    }

    q.push_back(1);
    dp[1]=0;
    for(int i=2;i<=n;i++)
        dp[i]=inf;
    used[1]=1;
    inQueue[1]=1;
    while(!q.empty())
    {
        int nod=q.front();
        for(auto it:v[nod])
        {
            if(dp[nod]+it.second<dp[it.first])
            {
                dp[it.first]=dp[nod]+it.second;
                if(!inQueue[it.first])
                {
                    q.push_back(it.first);
                    inQueue[it.first]=1;
                }
                used[it.first]++;
                if(used[it.first]==(n+1))
                {
                    printf("Ciclu negativ!\n");
                    return 0;
                }
            }
        }


        inQueue[nod]=0;
        q.pop_front();
    }

    for(int i=2;i<=n;i++)
        printf("%d ",dp[i]);
    printf("\n");

    return 0;
}