/*


      _             _    ___     ___    _  __       __
   __| |   __ _    / |  / _ \   / _ \  (_)/ /    _  \ \
  / _` |  / _` |   | | | | | | | | | |   / /    (_)  | |
 | (_| | | (_| |   | | | |_| | | |_| |  / /_     _   | |
  \__,_|  \__,_|   |_|  \___/   \___/  /_/(_)   (_)  | |
                                                    /_/


 */

//#include <iostream>
#include <queue>
#include <stack>
#include <map>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <set>
#include <algorithm>
#include <bitset>
#include <time.h>
#include <tuple>
#include <fstream>
#include <iomanip>
#include <utility>
#include <list>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/trie_policy.hpp>
#include <unordered_map>

#pragma warning "da 100% din tine. :)"
#define nl '\n'
#define cnl cout << '\n';
#define pb(x) push_back(x)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define ll long long
#define ull unsigned ll
#ifdef INFOARENA
#define ProblemName "dijkstra"
#endif
#define MCONCAT(A, B) A B
#ifdef ProblemName
#define InFile MCONCAT(ProblemName, ".in")
#define OuFile MCONCAT(ProblemName, ".out")
#else
#define InFile "a.in"
#define OuFile "a.out"
#endif


//using namespace __gnu_pbds;
using namespace std;
ifstream cin(InFile);
ofstream cout(OuFile);


//typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
//typedef trie<string, null_type, trie_string_access_traits<>, pat_trie_tag, trie_prefix_search_node_update> pref_trie;

template<class v, class type>
void print(v Vector, type nr) {
    for_each(all(Vector), [](type x) {
        cout << x << ' ';
    });
}

struct dij {
    int dist = 1'000'000'000;
    int id;
};

struct vertex {
    int dist = 1'000'000'000;
    list<dij> adjlist;
};

vertex v[50001];

inline void add(const int target, const int to_add_index, const int w) {
    dij temp;
    temp.dist = w;
    temp.id = to_add_index;
    v[target].adjlist.push_back(temp);

}

bitset<50001> viz;

#define pi pair<int,int>
#define F first
#define S second

inline void dijkstra(int start) {
    priority_queue<pair<int, int>, vector<pair<int, int> >, greater<> > q;
    q.push({v[start].dist, start});
    int i;
    while (!q.empty()) {
        i = q.top().S;
        q.pop();
        if (!viz[i])
            for (auto it = v[i].adjlist.begin(); it != v[i].adjlist.end(); ++it) {

                if (v[it->id].dist > v[i].dist + it->dist) {
                    v[it->id].dist = v[i].dist + it->dist;
                    q.push({v[it->id].dist, it->id});
                }

            }
        viz[i] = true;
    }
}

int main() {
    ios_base::sync_with_stdio(false);
//    clock_t tStart = clock();
    v[1].dist = 0;
    cin.tie(nullptr);
    int x, y, weight;
    int n, m, s;
    cin >> n >> m;
    for (int i = 0; i < m; ++i) {
        cin >> x >> y >> weight;
        add(x, y, weight);
    }
    dijkstra(1);
    for (int i = 2; i <= n; ++i) {
        if (v[i].dist == 1'000'000'000)
            cout << "0 ";
        else
            cout << v[i].dist << " ";
    }

    cout << nl;
//    printf("\nTime taken: %.2fs\n", (double) (clock() - tStart) / CLOCKS_PER_SEC);
}