#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <stack>
#include <queue>
#include <list>
//#include <windows.h>
//#include <conio.h>
#include <cstdlib>
#include <time.h>
#include <limits.h>
#include <string>
#include <math.h>
using namespace std;
#define forA(V,it) for (typeof(V.begin()) it=V.begin();it!=V.end();it++)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ll long long
#define ull unsigned ll
#define MOD 1000000007
#define INF (1<<31)-1
#define MINF -(1<<31)
#define vi vector <int>
#define vll vector <ll>
#define pii pair <int,int>
#define pll pair <ll,ll>
#define newl printf("\n")
#define DIM 1000000
priority_queue < pii > h;
pii nod;
vector < pii > G[50005];
int D[50005],i,N,M;
bool viz[50005];
int main()
{
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);
    scanf("%d %d",&N,&M);
    for (i=1;i<=M;i++)
    {
        int x,y,z;
        scanf("%d %d %d",&x,&y,&z);
        G[x].pb(mp(y,z));
    }
    for (i=1;i<=N;i++) D[i]=INF;
    D[1]=0;
    h.push(mp(0,1));
    while (!h.empty())
    {
        nod=h.top();
        h.pop();
        if (viz[nod.se]) continue;
        int x=nod.se;
        viz[x]=true;
        for (i=0;i<G[x].size();i++)
        {
            if (G[x][i].se+D[x]<D[G[x][i].fi])
            {
                D[G[x][i].fi]=G[x][i].se+D[x];
                h.push(mp(D[G[x][i].fi],G[x][i].fi));
            }
        }
    }
    for (i=2;i<=N;i++) printf("%d ",(D[i]==INF)?0:D[i]);
    return 0;
}