#include<fstream>
#include<iostream>
using namespace std;
const int maxn = 50001;
const int inf = 1 << 30;

ifstream f("dijkstra.in");
ofstream g("dijkstra.out");

struct graf
{
    int nod, cost;
    graf *next;
};

int n, m;
graf *a[maxn];
int d[maxn], q[maxn];

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()
{
    f>>n>>m;

    int x, y, z;
    for ( int i = 1; i <= m; ++i )
    {
       f>>x>>y>>z;
        add(x, y, z);
    }
}

void dijkstra()
{
    for ( int i = 2; i <= n; ++i )
        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] = 1;

        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();
    for ( int i = 2; i <= n; ++i )
        if(d[i]!=inf)
        g<<d[i]<<" ";
    return 0;
}