#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],inq[NM];
struct  pereche{
    int y,c;
};
struct compar{
 bool operator()(int x,int y)
{
    return d[x]<d[y];
}
};
vector<pereche> G[NM];
priority_queue <int, vector<int>, 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,&u.y,&u.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;
    inq[1]=1;
    H.push(1);
    while (!H.empty())
    {
        int i,j,im,y,c;
        im=H.top(); H.pop();
        inq[im]=0;
        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])
                {
                    d[y]=lg;
                    if(inq[y]==0)
                    {
                        inq[y]=1;
                        H.push(y);
                    }

                }
            }
     }
}
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;
}