#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
using namespace std;

ifstream f("dijkstra.in");
ofstream g("dijkstra.out");

const int NMAX = 5e4 + 5;
const int INF = 1e9;
int n, m, dist[NMAX];
bool vis[NMAX];
vector<pair<int, int>> graf[NMAX];
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
int main()
{
    f >> n >> m;
    while(m--) {
        int x, y, c;
        f >> x >> y >> c;
        graf[x].push_back(make_pair(y,c));
    }
    for(int i = 1; i <= n; i++) {
        dist[i] = INF;
    }
    dist[1] = 0;
    pq.push(make_pair(dist[1],1));
    while(!pq.empty()) {
        int nod = pq.top().second;
        int d = pq.top().first;
        pq.pop();
        if(vis[nod]) {
            continue;
        }
        vis[nod] = 1;
        for(int i = 0; i < (int)graf[nod].size(); i++) {
            int next = graf[nod][i].first;
            int cost = graf[nod][i].second;
            if(!vis[next] && d + cost < dist[next]) {
                dist[next] = d + cost;
                pq.push(make_pair(dist[next],next));
            }
        }
    }
    for(int i = 2; i <= n; i++) {
      if (dist[i] == INF) {
        g << 0 << ' ';
      } else {
        g << dist[i] << ' ';
      }
    }
    return 0;
}