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


ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");
const int MAX = 50001, INF = (1 << 30);
int n, d[MAX], m, sel[MAX];
vector<pair<int, int> > adj[MAX];
class mycomparison
{
public:
  bool operator() (const int &lhs, const int &rhs) const
  {
    return (d[lhs]>d[rhs]);
  }
};
void dijkstra(int s) {
    for(int i = 1; i <= n; ++i) {
        d[i] = INF;
    }
    d[s] = 0;
    priority_queue<int, vector<int>, mycomparison> pq;
    pq.push(s);
    while(!pq.empty()) {
        int u = pq.top();
        pq.pop();
        if(sel[u] == 1) continue;
        sel[u] = 1;
        for(auto it: adj[u]) {
            int v = it.first;
            int w = it.second;
            if(sel[v] == 0 && d[v] > d[u] + w) {
                d[v] = d[u] + w;
                pq.push(v);
            }
        }
    }
    for(int i = 1; i <= n; ++i) {
        if(d[i] == INF)
            d[i] = 0;
    }
}
int main()
{
    cin >> n >> m;
    for(int i = 1; i <= m; ++i) {
        int u, v, w;
        cin >> u >> v >> w;
        adj[u].push_back({v, w});
    }
    dijkstra(1);
    for(int i = 2; i <= n; ++i) {
        cout << d[i] << ' ';
    }

    return 0;
}