/*#include <cstdio>
#include <iostream>
#include <vector>
#include <set>

using namespace std;

#define DIM 50005

int N, M, x, y, lg, distmin[DIM];
int visited[DIM];
vector <vector <pair <int, int> > > Graph;
set <pair <int, int> > rs;

void Dijkstra(int nod);

int main() {
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);

    scanf("%d %d\n", &N, &M);

    Graph.resize(N + 1);

    for(int i = 1; i <= M; ++i) {
        scanf("%d %d %d\n", &x, &y, &lg);

        Graph[x].push_back(make_pair(y, lg));
    }

    for(int i = 2; i <= N; ++i) {
        distmin[i] = 2e8;
    }

    Dijkstra(1);

    for(int i = 2; i <= N; ++i) {
        cout << (distmin[i] == 2e8 ? 0 : distmin[i]) << ' ';
    }

    cout << '\n';

    return 0;
}

void Dijkstra(int nod) {
    visited[nod] = 1;

    vector <int> Next;

    for(auto x: Graph[nod]) {
        if(distmin[x.first] > distmin[nod] + x.second) {
            distmin[x.first] = distmin[nod] + x.second;
            Next.push_back(x.first);
        }
    }

    for(auto x: Next) {
        Dijkstra(x);
    }
}*/

#include <cstdio>
#include <cstring>
#include <set>
#include <vector>

using namespace std;

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

int N, M, d[MAXN]; vector<int> G[MAXN], C[MAXN];
set < pair<int, int> > T;

void solve(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]));
    }
}

int main(void)
{
    freopen("dijkstra.in", "rt", stdin);
    freopen("dijkstra.out", "wt", stdout);

    int i, a, b, c;

    scanf("%d %d\n", &N, &M);

    for(i = 1; i <= M; i++)
        scanf("%d %d %d\n", &a, &b, &c), G[a].pb(b), C[a].pb(c);

    solve();

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

    return 0;
}