#include <fstream>
#include <algorithm>
#define Nmax 50099
#define Mmax 250099
#define Inf 999999999
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
int n,m,start,d[Nmax];
struct muchie{int x,y,c;} a[Mmax];

inline void ReadInput()
{
    f>>n>>m; //>>start;
    start=1;
    fill(d+1,d+n+1,Inf);
    for(int i=1;i<=m;i++)
    {
        f>>a[i].x>>a[i].y>>a[i].c;
        if(a[i].x==start) d[a[i].y]=a[i].c;
        //if(a[i].y==start) d[a[i].x]=a[i].c;
    }

}

inline void Dijkstra()
{
    int gata=0;
    while(!gata)
    {
        gata=1;
        for(int i=1; i<=m; i++ )
            if(d[a[i].y]>d[a[i].x]+a[i].c)
            {
                gata=0;
                d[a[i].y]=d[a[i].x]+a[i].c;
            }
           /* else
            if(d[a[i].x]>d[a[i].y]+a[i].c)
            {
                gata=0;
                d[a[i].x]=d[a[i].y]+a[i].c;
            }
            */
    }
}

inline void PrintOutput()
{
     for(int i=1;i<=n;i++ )
        if (i!=start)
        {
                  if(d[i]>=Inf || i==start)  g<<0<<' ';
                                     else    g<<d[i]<<' ';
        }

}
int main()
{
    ReadInput();
    Dijkstra();
    PrintOutput();
    f.close();g.close();
    return 0;
}