#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 100005
int N,M,cost[50005];
vector < pii > G[50005];
bool used[50005];
queue <int> Q;
int main()
{
    freopen("bellmanford.in","r",stdin);
    freopen("bellmanford.out","w",stdout);
    scanf("%d %d",&N,&M);
    int x,y,z;
    while (M--)
    {
        scanf("%d %d %d",&x,&y,&z);
        G[x].pb(mp(y,z));
    }
    for (int i=1;i<=N;i++) cost[i]=INF;
    cost[1]=0;
    Q.push(1);
    used[1]=true;
    for (;Q.size();)
    {
        int nod=Q.front();
        for (vector <pii>::iterator it=G[nod].begin();it!=G[nod].end();it++)
        {
            if (cost[nod]+ it->se < cost[it->fi])
                cost[it->fi]=cost[nod]+it->se;
            if (!used[it->fi])
            {
                used[it->fi]=true;
                Q.push(it->fi);
            }
        }
        Q.pop();
    }
    for (int i=2;i<=N;i++) printf("%d ",cost[i]);
    return 0;
}