#include<fstream>
using namespace std;
const int inf = 1 << 30;
struct graf
{
    int nod,cost;
    graf*next;
};
int n,m;
graf *a[50001];
int d[50001],q[50001];
void add(int unde, int ce ,int cost)
{
    graf *q=new graf;
    q->nod=ce;
    q->cost=cost;
    q->next=a[unde];
    a[unde]=q;
}
void read()
{
    int x,y,z;
    ifstream f("dijkstra.in");
    f>>n>>m;
    for(int i=1;i<=m;i++)
    {
    f>>x>>y>>z;
    add(x,y,z);
    }
}
void dijkstra(int inceput)
{
    for ( int i = 1; i <= n; i++ )
    if(i!=inceput)
        d[i] = inf;

    int min, pmin = 0;
    for ( int i = 1; i <= n; i++ )
    {
        min = inf;

        for ( int j = 1; j <= n; j++ )
            if ( d[j] < min && q[j]==0 )
                min = d[j], pmin = j;

        q[pmin] = inceput;

        graf *t = a[pmin];

        while ( t )
        {
            if ( d[ t->nod ] > d[pmin] + t->cost )
                d[ t->nod ] = d[pmin] + t->cost;

            t = t->next;
        }
    }
}

int main()
{
    read();
    dijkstra(1);
 ofstream g("dijkstra.out");
    for ( int i = 2; i <= n; i++ )
    if(d[i]!=inf)
        g<<d[i]<<" ";
else
g<<"0 ";
    return 0;
}