using namespace std;

#include <set>
#include <map>
#include <list>
#include <deque>
#include <stack>
#include <queue>
#include <cmath>
#include <ctime>
#include <cctype>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <utility>
#include <iomanip>
#include <fstream>
#include <cstring>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>

#define oo (1<<30)
#define f first
#define s second
#define II inline
#define db double
#define ll long long
#define pb push_back
#define mp make_pair
#define Size(V) ((ll)(V.size()))
#define all(V) (V).begin() , (V).end()
#define CC(V) memset((V),0,sizeof((V)))
#define CP(A,B) memcpy((A),(B),sizeof((B)))
#define FOR(i,a,b) for(ll (i)=(a);(i)<=(b);++(i))
#define REP(i, N) for (ll (i)=0;(i)<(ll)(N);++(i))
#define FORit(it, x) for (__typeof((x).begin()) it = (x).begin(); it != (x).end(); ++it)
#define printll(x) printf("%lld",(x))
#define printsp() printf(" ")
#define newline() printf("\n")
#define readll(x) scanf("%lld",&(x))
#define debugll(x) fprintf(stderr,"%lld\n",(x))

#define IN "dijkstra.in" //"code.in"
#define OUT "dijkstra.out" //"code.out"

typedef vector<int> VI;
typedef pair<int,int> pi;
typedef pair<short int,short int> ps;
typedef vector<string> VS;
template<class T> string toString(T n) {ostringstream ost;ost<<n;ost.flush();return ost.str();}

#define N_MAX (1<<17)

int N,M;
bitset<N_MAX> viz;
int Dist[N_MAX];
vector< vector<pi> > V;

struct comp{ bool operator() (int i,int j) {return Dist[i] > Dist[j]; } };
priority_queue<int,VI,comp> Que;

II void init(int N)
{
    V.clear();
    V.resize(N + 10);
}

II void add_edge(int x,int y,int cost)
{
    V[x].pb( mp(y,cost) );
}

II int* Dijkstra(int Src)
{
    memset(Dist,100,sizeof(Dist));
    viz.reset();

    Dist[Src] = 0;
    viz[Src] = 0;
    Que.push(Src);

    for(int nod;!Que.empty();)
    {
        nod = Que.top();
        viz[nod] = false;
        Que.pop();

        FORit(it,V[nod])
            if(Dist[it->f] > Dist[nod] + it->s)
            {
                Dist[it->f] = Dist[nod] + it->s;

                if(!viz[it->f])
                {
                    viz[it->f] = true;
                    Que.push(it->f);
                }
            }
    }

    return Dist;
}

int* DistS;;
int main()
{
    freopen(IN,"r",stdin);
    freopen(OUT,"w",stdout);

    int x,y,c;
    scanf("%d%d",&N,&M);
    init(N);

    FOR(i,1,M)
    {
        scanf("%d%d%d",&x,&y,&c);
        add_edge(x,y,c);
    }

    DistS = Dijkstra(1);

    FOR(i,1,N)
        if(i != 1)
            printf("%d ",DistS[i] == Dist[0] ? 0 : DistS[i]);
}