#include <bits/stdc++.h>

using namespace std;
ifstream in("dijkstra.in");
ofstream out("dijkstra.out");
const int INF = 2000000000;
const int NMAX = 50001;
int n, price[NMAX];
bool viz[NMAX];
struct Radu{
    int dist, nod;
};
struct HeapNode{
    int dist, nod;
    bool operator < ( const HeapNode &other ) const {
        return dist > other.dist;
    }
};
priority_queue <HeapNode> pq;
vector <Radu> graf[NMAX];

void dijkstra( int nod ){
    for( int i = 2; i <= n; i++ )
        price[i] = INF;
    pq.push({0, nod});
    while( !pq.empty() ){
        nod = pq.top().nod;
        pq.pop();
        if( !viz[nod] ){
            viz[nod] = 1;
            for( auto vec : graf[nod] ){
                if( price[nod] + vec.dist < price[vec.nod] ){
                    price[vec.nod] = price[nod] + vec.dist;
                    pq.push({price[vec.nod], vec.nod});
                }
            }
        }
    }
}
int main()
{
    int m, cost, a, b;
    in >> n >> m;
    for( int i = 0; i < m; i++ ){
        in >> a >> b >> cost;
        graf[a].push_back({cost, b});
    }
    dijkstra(1);
    for( int i = 2; i <= n; i++ ){
        if( price[i] == INF )
            out << "0 ";
        else
            out << price[i] << " ";
    }
    return 0;
}