#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
using namespace std;
ifstream in("dijktra.in");
ofstream out("dijkstra.out");
const int oo = (1<<30);
const int nmax = 50001;
int n, m;
int D[nmax];
bool InCoada[nmax];
vector<pair<int, int>> G[nmax];
struct compara
{
   bool operator()(int x, int y)
   {
       return D[x]>D[y];
   }
};
priority_queue<int, vector<int>, compara> coada;
void citire()
{
    in>>n>>m;
    for(int i=1;i<=m;i++)
        {
            int x,y,c;
            in>>x>>y>>c;
            G[x].push_back(make_pair(y,c));
        }
}
void afisare()
{
    for(int i=2;i<=n;i++)
    if(D[i]!=oo)
        out<<D[i]<<" ";
    else out<<"0 ";
}
void dijkstra(int start)
{
    for(int i=1;i<=n;i++)
    D[i]=oo;
    D[start]=0;
    coada.push(start);
    InCoada[start]=true;
    while(!coada.empty())
    {
        int nod=coada.top();
        coada.pop();
        InCoada[nod]=false;
        for(unsigned int i=0;i<G[nod].size();i++)
        {
            int vecin=G[nod][i].first;
            int cost=G[nod][i].second;
            if(D[nod]+cost<D[vecin]){
            D[vecin]=D[nod]+cost;
            if(InCoada[vecin]==false){
            coada.push(vecin);
            InCoada[vecin]=true;}
                
            }
        }
        
    }
}
int main()
{
    citire();
    dijkstra(1);
    afisare();
    in.close();
    out.close();
    return 0;
}