#include <fstream>
#include <vector>
#include <set>
#define pii pair<int, int>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
const int NMAX = 5e5 + 5;
const char nl = '\n';
const int INF = 1e9 + 7;
vector<pii> g[NMAX];
int dist[NMAX];
void dijkstra(int source, int size) {
    for(int i = 1; i <= size; ++i) {
        dist[i] = INF;
    }
    set<pii> pq;
    dist[source] = 0;
    pq.insert({0, source});

    while(!pq.empty()) {
        auto x=pq.begin();
        int cur_node = x->second;
        int cur_weight = x->first;
        pq.erase(pq.begin());

        for(auto neigh: g[cur_node]) {
            if(dist[neigh.first] > dist[cur_node] + neigh.second) {
                pq.erase({dist[neigh.first], neigh.first});
                dist[neigh.first] = dist[cur_node] + neigh.second;
                pq.insert({dist[neigh.first], neigh.first});
            }
        }
    }
}

int main()
{


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

    dijkstra(1, n);

    for(int i = 2; i <= n; ++i) {
        if(dist[i] == INF) {
            fout << 0 << ' ';
        } else {
            fout << dist[i] << ' ';
        }
    }
    return 0;
}