#include <bits/stdc++.h>

using namespace std;

typedef pair < int , int > pii;

const int INF = 0x3f3f3f3f;
const int N_MAX = 50002;

priority_queue < pii , vector < pii > , greater < pii > > s;
vector < pii > v[N_MAX];

int d[N_MAX];

int main()
{
    freopen("dijkstra.in", "r", stdin);
    freopen("dijkstra.out", "w",  stdout);
    int n, m; scanf("%d %d", &n, &m);
    for(int i = 1, x, y, c; i <= m; i++)
    {
        scanf("%d %d %d", &x, &y, &c);
        v[x].push_back({y, c});
    }

    memset(d, INF, sizeof(d));
    d[1] = 0;
    for(int i = 1; i <= n; i++)
        s.push({d[i], i});

    while(!s.empty())
    {
        int x = s.top().second;
        s.pop();

        for(int i = 0; i < v[x].size(); i++)
        {
            int y = v[x][i].first, c = v[x][i].second;

            if(d[x] + c < d[y])
            {
                d[y] = d[x] + c;
                s.push({d[y], y});
            }
        }
    }

    for(int i = 2; i <= n; i++)
    {
        if(d[i] == INF)
            d[i] = 0;
        printf("%d ", d[i]);
    }
    printf("\n");
    fclose(stdin);
    fclose(stdout);
    return 0;
}