#include<cstdio>
#include<vector>
#define MAX_N 50000
#define oo 0x3f3f3f3f
using namespace std;

vector<pair<int,int> >g[MAX_N+1];
int dist[MAX_N+1], h[MAX_N+1], pos[MAX_N+1], n, m, heapSize;

void readGraph() {
    int i, x, y, cost;
    FILE* fin = fopen("dijkstra.in","r");
    fscanf(fin,"%d%d",&n,&m);
    for(i = 1; i <= m; i++) {
        fscanf(fin,"%d%d%d",&x,&y,&cost);
        g[x].push_back(make_pair(y,cost));
    }
    fclose(fin);
}

inline void Swap(int i, int j) {
    int aux = h[i];
    h[i] = h[j];
    h[j] = aux;
    aux = pos[h[i]];
    pos[h[i]] = pos[h[j]];
    pos[h[j]] = aux;
}

void heapDown(int i) {
    int l, r, ind;
    bool ok = true;
    while(ok) {
        l = (i << 1);
        r = (i << 1) + 1;
        if(l <= heapSize && dist[h[i]] > dist[h[l]])
            ind = l;
        else ind = i;
        if(r <= heapSize && dist[h[ind]] > dist[h[r]])
            ind = r;
        if(i != ind) {
            Swap(i,ind);
            i = ind;
        } else ok = false;
    }
}

void heapUp(int i) {
    while(dist[h[i>>1]] > dist[h[i]]) {
        Swap(i,i/2);
        i >>= 1;
    }
}

void Dijkstra(int s) {
    vector<pair<int,int> >::iterator it;
    int i, node;
    for(i = 1; i <= n; i++) {
        dist[i] = oo;
        h[i] = pos[i] = i;
    }
    dist[s] = 0;
    heapSize = n;
    for(i = 1; i < n; i++) {
        node = h[1];
        Swap(1,heapSize);
        --heapSize;
        heapDown(1);
        for(it = g[node].begin(); it != g[node].end(); it++) {
            if(dist[(*it).first] > dist[node] + (*it).second) {
                dist[(*it).first] = dist[node] + (*it).second;
                heapUp(pos[(*it).first]);
            }
        }
    }
}

void printDistances() {
    FILE* fout = fopen("dijkstra.out","w");
    for(int i = 2; i <= n; i++)
        if(dist[i] != oo)
            fprintf(fout,"%d ",dist[i]);
        else fprintf(fout,"0 ");
    fprintf(fout,"\n");
    fclose(fout);
}

int main() {
    readGraph();
    Dijkstra(1);
    printDistances();
    return 0;
}