#include <stdio.h>
#include <algorithm>
#include <vector>
#include <iterator>
const int maxn = 50001;
const int inf = 1 << 28;

FILE *in = fopen("dijkstra.in","r"), *out = fopen("dijkstra.out","w");

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

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

void add(int where, int what, int cost)
{
    graf *q = new graf;
    q->nod = what;
    q->cost = cost;
    q->next = a[where];
    a[where] = q;
}

void read()
{
    fscanf(in, "%d %d", &n, &m);

    int x, y, z;
    for ( int i = 1; i <= m; ++i )
    {
        fscanf(in, "%d %d %d", &x, &y, &z);
        add(x, y, z);
    }
}

void dijkstra()
{
    for(int i=2;i<=n;++i)d[i] = inf;

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

        minim = std::min_element(d+1,d+n+1);
        start = std::min_element(d+1,d+1);
        pmin = std::distance(start,minim)+1;

        q[pmin] = 1;

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

            t = t->next;
        }

    }
}

int main()
{
    read();
    dijkstra();

    for ( int i = 2; i <= n; ++i )
        fprintf(out, "%d ", d[i]-inf);
    fprintf(out, "\n");
	return 0;
}