#include <bits/stdc++.h>
#define pii pair<int, int>
#define x first
#define y second

using namespace std;

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

const int N_MAX = 50000 + 5;
const int inf = 0x3f3f3f3f;

priority_queue<pii, vector<pii>, greater<pii> > q;
vector<pii> vec[N_MAX];
int dp[N_MAX], n, m;
bitset<N_MAX> inq;

int main()
{
    fin >> n >> m;
    while(m--){
        int a, b, c;
        fin >> a >> b >> c;
        vec[a].push_back({b,c});
    }

    memset(dp, inf, sizeof(dp));

    dp[1] = 0;
    q.push({0,1});
    while(!q.empty()){
        int nod = q.top().y;
        int cost = q.top().x;
        q.pop();

        if(cost != dp[nod])
            continue;

        for(auto v : vec[nod])
            if(dp[v.x] > dp[nod] + v.y){
                dp[v.x] = dp[nod] + v.y;
                if(!inq[v.x]){
                    q.push({dp[v.x], v.x});
                    inq[v.x] = true;
                }
            }

        inq[nod] = false;
    }

    for(int i = 2; i<=n; ++i)
        if(dp[i] < inf)
            fout << dp[i] << " ";
        else
            fout << "0 ";
    return 0;
}