#include <fstream>
#include <vector>
#include <queue>
#include <bitset>

#define int long long
#define pii pair <int, int>

using namespace std;

ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");

const int N = 5 * 1e4 + 1, INF = 1e18 + 1;
vector <pii> adj[N];
priority_queue <pii> pq;
bitset <N> viz;
int costuri[N], n, m;

void djk(){
    pq.push({0, 1}); // {cost, nod}
    while(!pq.empty()){
        int nod = pq.top().second;
        pq.pop();
        if(!viz[nod]){
            for(auto vec : adj[nod]){
                if(vec.second + costuri[nod] < costuri[vec.first]){
                    costuri[vec.first] = vec.second + costuri[nod];
                    pq.push({-costuri[vec.first], vec.first});
                }
            }
        }
        viz[nod] = 1;
    }
}

signed main(){
    cin >> n >> m;
    for(int i = 0; i < m; i++){
        int a, b, c;
        cin >> a >> b >> c;
        adj[a].push_back({b, c});
    }
    for(int i = 2; i <= n; i++) costuri[i] = INF;
    djk();
    for(int i = 1; i <= n; i++) costuri[i] == INF ? cout << 0 << ' ' : cout << costuri[i] << ' ';
    return 0;   
}