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

using namespace std;

ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");

const int N = 50005;
const int M = 250005;
const int INF = 1 << 30;
struct muchie {
    int dest, cost;
};
vector<muchie> graf[N];
int cost[N];
bool done[N];

int main()
{
    int n, m;
    cin >> n >> m;
    for(int i = 1; i <= m; i++) {
        int x, y, c;
        cin >> x >> y >> c;
        graf[x].push_back({y, c});
    }
    cost[1] = 0;
    for(int i = 2; i <= n; i++) {
        cost[i] = INF;
    }
    priority_queue<pair<int, int>, vector<pair<int, int> >, greater<pair<int, int> > > q;
    q.push({0, 1});
    while(!q.empty()) {
        int now = q.top().second;
        q.pop();
        if(done[now]) {
            continue;
        }
        done[now] = true;
        for(muchie mu : graf[now]) {
            if(cost[now] + mu.cost < cost[mu.dest]) {
                cost[mu.dest] = cost[now] + mu.cost;
                q.push({cost[mu.dest], mu.dest});
            }
        }
    }
    for(int i = 2; i <= n; i++) {
        cout << (cost[i] == INF ? 0 : cost[i]) << ' ';
    }
    return 0;
}