#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

//Dijkstra
const int NMAX=50001;
const int oo = (1 << 30);
vector <pair<int,int>> G[NMAX];
int N,M,viz[NMAX],D[NMAX];

void read(){
    fin>>N>>M;
    for(int i=1;i<=M;i++)
    {
        int A,B,C;
        fin>>A>>B>>C;
        G[A].push_back(make_pair(B,C));
    }
}
priority_queue <pair<int,int>> q;
void Dijkstra(){
   for(int i = 1; i <= N; i++)
        D[i] = oo;
   D[1]=0;
   q.push({0,1});
   while(!q.empty()){
    auto cap=q.top();
    int nod=cap.second;
    q.pop();
    if(viz[nod]==1) continue;
    viz[nod]=1;
    for(auto nbr:G[nod]){
        int vecin=nbr.first;
        int cost=nbr.second;
        if(D[nod]+cost<D[vecin])
            {
                D[vecin]=cost+D[nod];
                    q.push({-D[vecin],nbr.first});

   }
   }
}
}

int main()
{
 read();
 Dijkstra();
 for(int i=2;i<=N;i++){
    if(D[i]==oo) D[i]=0;
    fout<<D[i]<<" ";
 }

}