#include<fstream>
#include<vector>
#include<set>

using namespace std;

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

const int Nmax=50000,oo=2000000000;
vector <pair <int, int> > G[Nmax+5];
set <pair <int, int> > Heap;
int N,M,DP[Nmax+5];

void Dijkstra(){
    for(int i=2;i<=N;i++)
        DP[i]=oo;
    Heap.insert({0,1});
    while(!Heap.empty()){
        pair <int, int> Nod=*Heap.begin();
        Heap.erase(Heap.begin());
        for(auto i:G[Nod.second]){
            if(DP[i.first]>DP[Nod.second]+i.second){
                if(DP[i.first]!=oo)
                   Heap.erase(Heap.find({DP[i.first],i.first}));
                DP[i.first]=DP[Nod.second]+i.second;
                Heap.insert({DP[i.first],i.first});
            }
        }
    }
    for(int i=2;i<=N;i++)
        if(DP[i]==oo)
        fout<<0<<" ";
    else
        fout<<DP[i]<<" ";
    fout<<'\n';
}

int main(){
    fin>>N>>M;
    for(int i=1;i<=M;i++){
        int X,Y,Z;
        fin>>X>>Y>>Z;
        G[X].push_back({Y,Z});
    }
    Dijkstra();
}