# include <cstdio>
# include <cstring>
# include <queue>
# include <vector>
using namespace std;

const char *FIN = "dijkstra.in", *FOU = "dijkstra.out";
const int MAX = 50005, oo = 0x3f3f3f3f;

vector < pair <int, int> > G[MAX];
int N, M, dp[MAX];

void solve (void) {
    queue <int> Q;
    bool viz[MAX];

    memset (dp, 0x3f, sizeof (dp));
    memset (viz, 0, sizeof (viz));
    dp[1] = 0;
    for (Q.push (viz[1] = 1); ! Q.empty (); Q.pop ()) {
        int act = Q.front (); viz[act] = 0;
        for (vector < pair <int, int> > :: iterator it = G[act].begin (); it != G[act].end (); ++it)
            if (dp[act] + it -> second < dp[it -> first]) {
                dp[it -> first] = dp[act] + it -> second;
                if (viz[it -> first] == 0) {
                    Q.push (it -> first);
                    viz[it -> first] = 1;
                }
            }
    }
}

int main (void) {
    freopen (FIN, "r", stdin);
    freopen (FOU, "w", stdout);

    scanf ("%d %d", &N, &M);
    for (int i = 1, x, y, z; i <= M; ++i) {
        scanf ("%d %d %d", &x, &y, &z);
        G[x].push_back (make_pair (y, z));
    }
    solve ();
    for (int i = 2; i <= N; ++i)
        printf ("%d ", dp[i] < oo ? dp[i] : 0);
}