#include<cstdio>
#include<fstream>
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<bitset>
#include<deque>
#include<queue>
#include<set>
#include<map>
#include<cmath>
#include<cstring>
#include<ctime>
#include<cstdlib>
#include<unordered_map>

#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define pll pair<ll,ll>
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second

using namespace std;

const int nmax = 50005;
const int inf = (1LL << 31) - 1;

int i, n, m, x, y, z, d[nmax];

vector<pii> v[nmax];
bitset<nmax> viz;
priority_queue<pii, vector<pii>, greater<pii>> q;

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

    scanf("%d%d", &n, &m);

    for(; m; m--)
    {
        scanf("%d%d%d", &x, &y, &z);
        v[x].pb(mp(y, z));
    }

    for(i = 1; i <= n; i++)
        d[i] = inf;

    d[1] = 0;
    q.push(mp(0, 1));

    while(!q.empty())
    {
        x = q.top().se;
        q.pop();

        if(viz[x])
            continue;
        viz[x] = 1;

        for(auto it : v[x])
            if(d[x] + it.se < d[it.fi])
            {
                d[it.fi] = d[x] + it.se;
                q.push(mp(d[it.fi], it.fi));
            }
    }

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

    return 0;
}