#include <set>
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <cstring>

#define pb push_back
#define mp make_pair
#define MAXN 50100
#define INF 100000000

using namespace std;

int n,m,d[MAXN];
vector <int> G[MAXN], C[MAXN];
set < pair <int, int> > T;

void dijkstra(void)
{
    int i,j,k,val,x;

    for (i=2;i<=n;i++)
    d[i]=INF;
    T.insert (mp(0,1));

    while(T.size()>0)
    {
        val = (*T.begin()).first, x = (*T.begin()).second;
        T.erase(*T.begin());
        for (i=0;i<G[x].size();i++)
            if (d[G[x][i]] > val + C[x][i])
                d[G[x][i]] = val + C[x][i], T.insert (mp(d[G[x][i]],G[x][i]));

    }
}

void citire()
{
    int a,b,c;
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);
    scanf("%d %d", &n, &m);
    for(int i=1;i<=m;i++)
    scanf("%d %d %d\n",&a, &b, &c), G[a].pb(b), C[a].pb(c);
}

void afisare()
{
    int i;
    for (i=2;i<=n;i++)
    printf("%d ", d[i] == INF ? 0 : d[i]);
}


int main()
{
    citire();
    dijkstra();
    afisare();
}