#include <fstream>
#include <vector>
#include <utility>
#include <queue>
using namespace std;
#define DMAXNOD 50005
#define INFINIT 100000000000
FILE*fin=fopen("bellmanford.in","r");
FILE*fout=fopen("bellmanford.out","w");
vector< pair <int,int> > matrice[DMAXNOD];
queue<int> coada;
int n,m,dmin[DMAXNOD],nr[DMAXNOD],pred[DMAXNOD];
void citire()
{
    fscanf(fin,"%d%d",&n,&m);
    for(int i=1;i<=m;i++)
    {
        int a,b,c;
        fscanf(fin,"%d%d%d",&a,&b,&c);
        matrice[a].push_back(make_pair(b,c));
    }
}
bool bellmanfort(int nod)
{
    int i;
    for(i=2;i<=n;i++)
    {
        dmin[i]=INFINIT;
        pred[i]=1;
    }
    coada.push(1);
    nr[1]++;
    while(!coada.empty())
    {
        int x;
        x=coada.front();
        coada.pop();
        for(i=0;i<matrice[x].size();i++)
        {
            int y=matrice[x][i].first;
            int c=matrice[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()
{
    fprintf(fout,"%d ",dmin[2]);
    for(int i=3;i<=n;i++)
        fprintf(fout,"%d ",dmin[i]);
    fprintf(fout,"\n");
}
int main()
{
    citire();
    if(bellmanfort(1)==false)
        fprintf(fout,"false\n");
    else
    {
        afisare();
    }
    return 0;
}