#include <iostream>
#include <stdio.h>
using namespace std;
FILE *f,*g;
struct graph
{
    int node, next, cost;
}v[250002];
int start[50002],d[50002],coada[250002],been[50002];
int n,m;
void read()
{
    int x,y,c,k=0;
    fscanf(f,"%d %d",&n,&m);
    for(int i=1; i<=m; i++)
    {
        fscanf(f,"%d %d %d",&x,&y,&c);
        v[++k].node=y;
        v[k].next=start[x];
        v[k].cost=c;
        start[x]=k;
    }
}
void Bellmanford()
{
    int pi,ps,x;
    for(int i=1; i<=n; i++)
        d[i]=99999999;
    coada[pi=ps=0]=1;
    d[1]=0;
    been[1]=1;
    while(ps<=pi)
    {
        x=coada[ps];
        been[x]=0;
        for(int i=start[x]; i; i=v[i].next)
        {
            if(d[x]+v[i].cost<d[v[i].node])
            {
                d[v[i].node]=d[x]+v[i].cost;
                if(!been[v[i].node])
                    coada[++pi]=v[i].node;
            }
        }
        ps++;
    }
}
void write()
{
    for(int i=1; i<=n; i++)
        fprintf(g,"%d ",d[i]);
}
int main()
{
    f=fopen("car.in","r");
    g=fopen("car.out","w");
    read();
    Bellmanford();
    write();
    fclose(f);
    fclose(g);
    return 0;
}