#include <bits/stdc++.h>
#define NMAX 50005
#define inf (1 << 30)
using namespace std;

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

int n, m, d[NMAX];
bool inQueue[NMAX];


struct comp{
    bool operator()(int x, int y){
        return d[x] > d[y];
    }
};

vector < pair <int, int> > v[NMAX];
priority_queue < int, vector < int >, comp> q;


void read(){
    fin>>n>>m;

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

    for(int i=2;i<=n;i++){
        d[i] = inf;
    }
    d[1] = 0;
}

void dij(int nod){

    q.push(nod);
    inQueue[nod] = 1;
    while(!q.empty()){
        nod = q.top();
        q.pop();
        inQueue[nod] = 0;

        for(unsigned int i=0;i<v[nod].size();i++){
            int vecin = v[nod][i].first;
            int cost = v[nod][i].second;
            if(d[nod] + cost < d[vecin]){
                d[vecin] = d[nod] + cost;
                if(!inQueue[vecin]){
                    inQueue[vecin] = 1;
                    q.push(vecin);
                }
            }
        }
    }
}

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

int main(){
    read();
    dij(1);
    post();
    return 0;
}