#include <cstdio>
#include <set>
#include <vector>
using namespace std;
#define INF 100000000
#define NMAX 200001

int D[NMAX], N, M, i;
vector< pair<int, int> > G[NMAX];
set< pair<int, int> > H;
inline void solve()
{
    int cost, nod;
    for (int i=2; i<=N; i++) D[i]=INF;
    H.insert( make_pair(0, 1) );
    while ( H.size()>0 )
    {
        cost= ( *H.begin() ).first;
        nod = ( *H.begin() ).second;
        H.erase( *H.begin() );
        for (unsigned int i=0; i<G[nod].size(); i++)
            if ( D[G[nod][i].second]> cost+ G[nod][i].first  )
                D[G[nod][i].second]= cost+ G[nod][i].first , H.insert( make_pair(D[G[nod][i].second], G[nod][i].second) );
    }
}


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, c;
        scanf("%d%d%d", &x, &y, &c);
        G[x].push_back( make_pair(c, y) );
    }

    solve();
    for (i=2; i<=N; i++)
        printf("%d ", D[i]==INF ? 0 : D[i]);
    return 0;
}