#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define ar array
#define vt vector
#define pq priority_queue
#define pu push
#define pub push_back
#define em emplace
#define emb emplace_back

#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define allp(x, l, r) x.begin() + l, x.begin() + r
#define len(x) (int)x.size()

using namespace std;
using namespace __gnu_pbds;

using ll = long long;
using ld = long double;
using ull = unsigned long long;

template <class T, size_t N>
void re(array <T, N>& x);
template <class T> 
void re(vt <T>& x);

template <class T> 
void re(T& x) {
    cin >> x;
}

template <class T, class... M> 
void re(T& x, M&... args) {
    re(x); re(args...);
}

template <class T> 
void re(vt <T>& x) {
    for(auto& it : x)
        re(it);
}

template <class T, size_t N>
void re(array <T, N>& x) {
    for(auto& it : x)
        re(it);
}

template <class T, size_t N>
void wr(array <T, N> x);
template <class T> 
void wr(vt <T> x);

template <class T> 
void wr(T x) {
    cout << x;
}

template <class T, class ...M>  void wr(T x, M... args) {
    wr(x), wr(args...);
}

template <class T> 
void wr(vt <T> x) {
    for(auto it : x)
        wr(it, ' ');
}

template <class T, size_t N>
void wr(array <T, N> x) {
    for(auto it : x)
        wr(it, ' ');
}


inline void Open(const string Name) {
    #ifndef ONLINE_JUDGE
        (void)!freopen((Name + ".in").c_str(), "r", stdin);
        (void)!freopen((Name + ".out").c_str(), "w", stdout);
    #endif
}

void solve() {
    /* standard algorithm */
    function <void(int, int)> dijkstra;
    int n, m; re(n, m);
    vt <vt <ar <ll, 2>>> adj(n);
    for (int i = 0; i < m; ++i) {
        int u, v, c; re(u, v, c);
        --u, --v;
        adj[u].pub({v, c});
    }

    dijkstra = [&](int s, int t) {
        using pii = ar <ll, 2>; 
        const ll INF = 1e18;

        vt <ll> d(n, INF);
        pq <pii, vt <pii>, greater <pii>> q;

        d[s] = 0;
        q.pu({d[s], s});
        while (len(q)) {
            auto [cur, u] = q.top();
            q.pop();
            if (d[u] != cur) {
                continue;
            }

            for (auto [v, cost] : adj[u]) {
                if (d[u] + cost < d[v]) {
                    d[v] = d[u] + cost;
                    q.pu({d[v], v});
                }
            }
        }

        for (int i = 1; i < n; ++i)
            wr(d[i] == INF? 0 : d[i], ' ');
    };

    dijkstra(0, n - 1);
}   

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    Open("dijkstra");

    int t = 1;
    for(;t;t--) {
        solve();
    }
    
    return 0;
}