///infoarena!!!!!!!!!!!!!!!!!!!!!!!
#include<bits/stdc++.h>
#define NM 100001
#define INF 200000000
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int n, m,p, d[NM],viz[NM];
struct  pereche
{
    int y,c;
};

struct compar
{
    bool operator()(pereche p1,pereche p2)
    {
        return p1.c>p2.c;
    }
};

vector<pereche> G[NM];

priority_queue <pereche, vector<pereche>, compar> q;

void Citeste()
{
    int i, x,y,c;
    pereche u;
    fin>>n>>m;
    for (i=1; i<=m; ++i)
    {
        fin>>x>>u.y>>u.c;
        G[x].push_back(u);
    }

}
void Dijkstra()
{
    int lg,c;
    int i,j,im,y;
    for (i=2; i<=n; i++)
        d[i]=INF;
    d[1]=0;

    pereche p;
    p= {1,0};/// nod, cost
    q.push(p);

    while (!q.empty())
    {
        p=q.top();
        q.pop();

        im=p.y;
        if(viz[im]==0)
        {
            viz[im]=1;

            for(j=0; j<G[im].size(); j++)
            {
                y=G[im][j].y;
                c=G[im][j].c;

                lg=c+d[im];
                if(viz[y]==0 && lg<d[y])
                {
                    d[y]=lg;
                    ///adaug o pereche formata din nod si distanta la nodul initial
                    p={y,d[y]};
                    q.push(p);
                }

            }
        }

    }
}
void Scrie()
{
    int i;
    for (i=2; i<=n; ++i)
        if(d[i]<INF)
            fout<<d[i]<<" ";
        else fout<<0<<' ';

}
int main()
{
    Citeste();
    Dijkstra();
    Scrie();
    return 0;
}