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

using namespace std;

ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

const int NMAX = 50005;
const int INF = 1e9;
#define pii pair <int, int>

struct Muchie{
    int to, cost;
};

int d[NMAX];
vector <Muchie> g[NMAX];

void dijkstra(int start){
    priority_queue <pii, vector <pii>, greater <pii>> pq;
    pq.push({0, start});
    while(!pq.empty()){
        pii temp = pq.top();
        int node = temp.second;
        int cost = temp.first;
        pq.pop();
        if(d[node] != cost){
            continue;
        }
        for(auto i:g[node]){
            int to = i.to;
            int new_cost = i.cost;
            if(d[to] > d[node] + new_cost){
                d[to] = d[node] + new_cost;
                pq.push({d[to], to});
            }
        }
    }
}

void solve(){
    int n, m;
    fin >> n >> m;
    for(int i = 1; i <= m; ++i){
        int x, y, cost;
        fin >> x >> y >> cost;
        Muchie temp;
        temp.to = y;
        temp.cost = cost;
        g[x].push_back(temp);
    }
    for(int i = 1; i <= n; ++i){
        d[i] = INF;
    }
    int start = 1;
    d[start] = 0;
    dijkstra(start);
    for(int i = 2; i <= n; ++i){
        if(d[i] == INF){
            d[i] = 0;
        }
        fout << d[i] << " ";
    }
}

int main()
{
    solve();
    return 0;
}