#include <iostream>
#include <fstream>
#define NM 50001
#define INF 2000000
#include<queue>
#include<vector>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int n,d[NM],inq[NM],x0,im,m,x;
struct compar {
    bool operator()(int x,int y)
    {
        return d[x]>d[y];
    }
};
struct arc{
    int c,y;
}u;
vector<arc>G[NM];
void citire()
{
    int i;
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>x>>u.y>>u.c;
        G[x].push_back(u);
    }

}
priority_queue<int,vector<int>,compar>q;
void Dijkstra(int x0)
{
    int i,j,y,c,lg;
    for(i=1;i<=n;i++)
        d[i]=INF;
    d[x0]=0;

    inq[x0]=1;
    q.push(x0);

     while(!q.empty())
     {
         im=q.top();
         q.pop();
            inq[im]=0;
         for(j=0;j<G[im].size();j++)
         {
             y=G[im][j].y;
             c=G[im][j].c;
             lg=c+d[im];

             if(lg<d[y])
             {
                 d[y]=lg;
                 if(inq[y]== 0)
                 {
                     inq[y]=1;
                     q.push(y);
                 }
             }
         }
     }

}

int main()
{
    citire();
    Dijkstra(1);
    for(int i=2;i<=n;i++)
        if(d[i]<INF)fout<<d[i]<<' ';
        else fout<<'0'<<' ';
    return 0;
}