#include<fstream>
#include<vector>
#include<queue>
#define NM 50001
#define INF 2500010
//#include<stdio.h>
using namespace std;
ifstream f("dijkstra.in");
//FILE *f=fopen("dijkstra.in","r");
ofstream g("dijkstra.out");
//FILE *g=fopen("dijkstra.out","w");
int n, m, d[NM];
struct  pereche{
    int y,c;
};
struct compar{
 bool operator()(pereche a,pereche b)
{
    return a.c<b.c;
}
};
vector<pereche> G[NM];
priority_queue <pereche, vector<pereche >, compar> H;
void Citeste()
{
    int i, x, y, c;
    pereche u;
    f>>n>>m;
    //fscanf(f,"%d %d",&n,&m);
    for (i=1; i<=m; ++i)
    {
        f>>x>>u.y>>u.c;
        //fscanf(f,"%d %d %d",&x,&y,&c);
        G[x].push_back(u);
    }
     d[1]=0;
    for (i=2; i<=n; ++i) d[i]=INF;
}
void Dijkstra()
{
    pair<int, int> pr;
    int z,lg;
    pereche u,w;
    u.y=1;
    u.c=0;
    H.push(u);
    while (!H.empty())
    {
        int i,j,im,y,c;
        u=H.top(); H.pop();
        im=u.y;
        for(j=0;j<G[im].size();j++)
            {
                y=G[im][j].y;
                c=G[im][j].c;
                lg=d[im]+c;
                if(lg<d[y])
                {
                    w.y=y;
                    w.c=lg;
                    H.push(w);
                    d[y]=lg;
                }
            }
     }
}
void Scrie()
{
    int i;
    for (i=2; i<=n; ++i)
        if (d[i]==INF) g<<"0 ";
             // fprintf(g,"%d ",0);
            else g<<d[i]<<" ";
               //fprintf(g,"%d ",D[i]);
}
int main()
{
    Citeste();
    Dijkstra();
    Scrie();
   return 0;
}