#include <iostream>
#include <fstream>
#include <queue>
#include <vector>

using namespace std;
ifstream in("dijkstra.in");
ofstream out("dijkstra.out");

#define pb push_back
const int NMax = 5e4 + 5;
const int inf = 2e9 + 5;

int N,M;
int dist[NMax];

struct elem {
    int y,cost;
    elem(int _y = 0,int _cost = 0) {
        y = _y;
        cost = _cost;
    }
};
bool operator <(elem a,elem b) {
    return a.cost > b.cost;
}

vector<elem> v[NMax];

int main() {
    in>>N>>M;
    for (int i=1;i<=M;++i) {
        int x,y,c;
        in>>x>>y>>c;
        v[x].pb(elem(y,c));
    }

    for (int i=2;i<=N;++i) {
        dist[i] = inf;
    }
    dist[1] = 0;
    priority_queue<elem> Q;
    Q.push(elem(1,0));
    while (Q.size()) {
        elem e = Q.top();
        Q.pop();
        int nod = e.y;
        if (dist[nod] < e.cost) {
            continue;
        }

        for (int k=0;k < (int)v[nod].size();++k) {
            int next = v[nod][k].y, cost = v[nod][k].cost;
            if (dist[next] <= dist[nod] + cost) {
                continue;
            }

            dist[next] = dist[nod] + cost;
            Q.push(elem(next,dist[next]));
        }
    }
    for (int i=2;i<=N;++i) {
        out<<( (dist[i] == inf) ? 0 : dist[i] )<<' ';
    }

    in.close();out.close();
    return 0;
}