#include <bits/stdc++.h>
#define NMAX 50001
#define inf 20001
using namespace std;

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

int n, m, x, y, c;
int cost[NMAX];
vector < int > v[NMAX], p[NMAX];
queue < pair <int, int> > q;

void read(){
    fin>>n>>m;
    for(int i=1;i<=m;i++){
        fin>>x>>y>>c;
        v[x].push_back(y);
        p[x].push_back(c);
    }
}

void dji(){
    q.push({1, 0});

    while(!q.empty()){
        int nod = q.front().first;
        int dis = q.front().second;
        q.pop();
        for(int i=0;i<v[nod].size();i++){
            if(dis + p[nod][i] < cost[v[nod][i]]){
                cost[v[nod][i]] = dis + p[nod][i];
                q.push({v[nod][i], cost[v[nod][i]]});
            }
        }
    }
}

int main(){
    read();
    for(int i=2;i<=n;i++){
        cost[i] = inf;
    }

    dji();

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