#include<bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define lsb(x) ((x) & (-x))
#define max(...) max({__VA_ARGS__})
#define min(...) min({__VA_ARGS__})
#define hmap unordered_map
#define var auto &
#define hset unordered_set
#define pq priority_queue
#define exists(x, v) (v.find(x) != v.end())
#define inrange(x, a, b) (x >= a && x <= b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long int ull;
typedef pair<int, int> p32;
typedef pair<ll, ll> p64;
typedef pair<double, double> pdd;
typedef pair<ull, ull> p64_u;
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef HOME
    ~debug() { cerr << endl; }
    eni(!= ) cerr << boolalpha << i; ris;
}
eni(== ) ris << range(begin(i), end(i));
}
sim, class b dor(pair < b, c > d) {
    ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
    *this << "[";
    for (auto it = d.b; it != d.e; ++it)
        *this << ", " + 2 * (it == d.b) << *it;
    ris << "]";

}

#else
    sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define darr(x,n) debug() <<#x<<": "<< range(x,x+n+1)
#define dmat(x,n,m) for(int i=0;i<=n;i++) if(!i) debug() <<#x << ":" << range(x[i],x[i]+m+1); else debug() << range(x[i],x[i]+m+1);
const int lim = 5e4 + 5;
const int inf = (int)0x3f3f3f3f;

int dist[lim];
struct comp
{
    bool operator()(int a, int b)
    {
        return dist[a] > dist[b];
    }
};
pq<int, vector<int>, comp> q;
vector<p32> g[lim];
bool inq[lim];
int n, m;

int main()
{
    freopen("dijkstra.in", "r", stdin);
    freopen("dijkstra.out", "w", stdout);

    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    cin >> n >> m;
    for (int i = 1; i <= m; i++)
    {
        int x, y, z;
        cin >> x >> y >> z;
        g[x].push_back({ y,z });
    }
    for (int i = 1; i <= n; i++)
        dist[i] = inf;

    dist[1] = 0;
    inq[1] = true;
    q.push(1);
    while (!q.empty())
    {
        auto nod = q.top();
        q.pop();
        inq[nod] = false;

        for (auto it : g[nod])
        {
            int vec = it.first;
            int c = it.second;
            if (dist[nod] + c < dist[vec])
            {
                dist[vec] = dist[nod] + c;
                if (!inq[it.first])
                {
                    q.push(it.first);
                    inq[it.first] = true;
                }
            }
        }
    }
    for (int i = 2; i <= n; i++)
        if (dist[i] == inf)
            cout << "0 ";
        else
            cout << dist[i] << " ";

    return 0;
}