#include <cstdio>
#include <vector>
#include <queue>
#define vecin G[nod][i].first
#define cost G[nod][i].second
using namespace std;

vector< pair<int, int> > G[50005];
int n, m, x, y, c, i, j, s, d[50005];

struct cmp {
    bool operator()(int a, int b) {
        return d[a] > d[b];
    }
};

priority_queue<int, vector <int> , cmp> pq;
bool inQueue[50005];

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

    for(i = 2; i <= n; ++i) {
        inQueue[i] = 0;
        d[i] = 20001;
    }
    pq.push(1);
    d[1] = 0;
    inQueue[1] = 1;

    while(!pq.empty()) {
        int nod = pq.top();
        pq.pop();
        inQueue[nod] = 0;
        s = G[nod].size();
        for(i = 0; i < s; ++i)
            if(d[vecin] > d[nod] + cost) {
                d[vecin] = d[nod] + cost;
                if(inQueue[vecin] == 0) {
                    pq.push(vecin);
                    inQueue[vecin] = true;
                }
            }
    }

    for(i = 2; i <= n; ++i)
        if(d[i] != 20001)
            printf("%d ", d[i]);
        else
            printf("0 ");
            printf("0 ");
}