#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
const int MAX = 5e4 + 10, INF = 2e9;
int n, dp[MAX], m, sel[MAX];
vector<pair<int, int> > adj[MAX];

struct compara
{
    bool operator() (const pair<int, int> &lhs, const pair<int, int> &rhs) const
    {
        return (lhs.second > rhs.second);
    }
};

void citire() {
   fin >> n >> m;
    for(int i = 1; i <= m; i++) {
        int u, v, w;
        fin >> u >> v >> w;
        adj[u].push_back({v, w});
     }
}

void dijkstra(int s) {

    for(int i = 1; i <= n; i++) {
        dp[i] = INF;
    }
    dp[s] = 0;
    priority_queue<pair<int, int>, vector<pair<int, int> >, compara> coada;
    coada.push({s, dp[s]});
    while(!coada.empty()) {
        int u = coada.top().first;
        int dist = coada.top().second;
        coada.pop();
        if(dist > dp[u]) 
		continue;
        for(int i = 0; i < adj[u].size(); i++) {
            int v = adj[u][i].first;
            int w = adj[u][i].second;
            if(sel[v] == 0 && dp[v] > dp[u] + w) {
                dp[v] = dp[u] + w;
                coada.push({v, dp[v]});
            }
        }
    }
    for(int i = 1; i <= n; i++) {
        if(dp[i] == INF)
            dp[i] = 0;
    }
}
int main()
{
    citire();
    dijkstra(1);
    for(int i = 2; i <= n; i++) {
        fout << dp[i] << ' ';
    }
 
    return 0;
}