#include <fstream>
#include <vector>
#include <limits>

using namespace std;

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

vector < pair < int, int> > L[50004];
int n, m, x, y, z, v[50004], w[50004], nod;

int main()
{
    fin>>n>>m;
    for(int i = 1; i <= m; i++){
        fin>>x>>y>>z;
        L[x].push_back(make_pair(y, z));
    }
    for(int i = 2; i <= n; i++){
        v[i] = INT_MAX;
    }
    v[1] = 0;
    while(true){
        int minim = INT_MAX;
        for(int i = 1; i <= n; i++){
            if(v[i] < minim && w[i] == 0){
                minim = v[i];
                nod = i;
            }
        }
        if(minim == INT_MAX){
            break;
        }
        w[nod] = 1;
        for(int i = 0; i < L[nod].size(); i++){
            int vecin = L[nod][i].first;
            int cost = L[nod][i].second;
            v[vecin] = min(v[vecin], v[nod] + cost);
        }
    }
    for(int i = 2; i <= n; i++){
        if(v[i] != INT_MAX){
            fout<<v[i]<<" ";
        }
        else{
            fout<<0<<" ";
        }
    }
    return 0;
}