#include <fstream>
#include <queue>
#include <vector>
using namespace std;
ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");
const int inf=1e9;
vector<vector<pair<int,int>>>gr;
vector<int>distanta;
priority_queue<pair<int,int>,vector<pair<int,int>>,greater<>>q;

void dijkstra(int nod){
    distanta[nod]=0;
    q.push({distanta[nod],nod});

   pair<int,int> nod_curent;

    while(!q.empty()){

        nod_curent=q.top();
        q.pop();

        if(nod_curent.first!=distanta[nod_curent.second]){
            continue;
        }

        for(const auto&nod:gr[nod_curent.second]){
            if(distanta[nod_curent.second]+nod.second<distanta[nod.first]){

                distanta[nod.first]=distanta[nod_curent.second]+nod.second;

                q.push({distanta[nod.first],nod.first});
            }
        }
    }
}
int main(){

    int n,m,nod1,nod2,cost;
    cin>>n>>m;

    gr.resize(n+1);
    distanta.resize(n+1,inf);

    for(int i=1;i<=m;i++){
        cin>>nod1>>nod2>>cost;
        gr[nod1].push_back({nod2,cost});
    }

    dijkstra(1);

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