#include <stdio.h>
#include <vector>
#include <queue>
#include <utility>
using namespace std;
#define IN "bellmanford.in"
#define OUT "bellmanford.out"
#define NMAX 50005
#define INF 100000000
FILE* fout=fopen(OUT,"w");

int n,m;
queue<int> coada;
vector<pair <int,int> > graf[NMAX];
int dmin[NMAX], nr[NMAX], pred[NMAX];

void citire();
bool bellmanford();
void afisare();
int main()
{
    citire();
    if(bellmanford()==false)
    fprintf(fout,"Ciclu negativ!\n");
    else
    afisare();
    return 0;
}

void citire()
{
    FILE *fin=fopen(IN,"r");

    int i,x,y,cost;
    fscanf(fin,"%d%d",&n,&m);
    for(i=1;i<=m;i++)
    {
        fscanf(fin,"%d%d%d",&x,&y,&cost);
        graf[x].push_back(make_pair(y,cost));
    }
    fclose(fin);
}

bool bellmanford()
{
   int i,x,y,c;
   for(i=2;i<=n;i++)
    {dmin[i]=INF;
     pred[i]=1;
    }
    coada.push(1);
    nr[1]++;
    while(!coada.empty())
    {
        x=coada.front();
        coada.pop();
        for(i=0;i<graf[x].size();i++)
        {
            y=graf[x][i].first;
            c=graf[x][i].second;
            if(dmin[y]>dmin[x]+c)
            {
                dmin[y]=dmin[x]+c;
                pred[y]=x;
                coada.push(y);
                nr[y]++;
                if(nr[y]==n)
                return false;
            }
        }
    }
    return true;
}

void afisare()
{
    int i;
    fprintf(fout,"%d",dmin[2]);
    for(i=3;i<=n;i++)
    {
        fprintf(fout,"%d",dmin[i]);
    }
    fprintf(fout,"\n");
}