#include <bits/stdc++.h>
#define dim 50005
#define oo 100000000
std::ifstream in("dijkstra.in");
std::ofstream out("dijkstra.out");
using namespace std;
int D[dim];int n,m;
bool viz[dim];
vector< pair<int,int> >graf[dim];
struct cmpD{
     bool operator()(int x,int y){
     return D[x]>D[y];
     }
};
priority_queue<int, vector<int>,cmpD>q;
void citire()
{
    in >> n >> m ;
     for( int i = 1; i<=m ;++i)
     {
         int x,y,c;
         in >> x >> y >> c ;
         graf[x].push_back(make_pair(y,c));
     }
}

void diji(int nod)
{
    for(int i =1; i<=n ;++i)
        if(i!=nod)D[i]=oo;
    viz[nod]=1;
    q.push(nod);
    while ( !q.empty())
    {
        int x=q.top();
        q.pop();
        viz[x]=false;
        for( int i = 0 ; i< graf[x].size();++i)
        {
            int NODE=graf[x][i].first;
            int COST=graf[x][i].second;
               if(D[NODE]>D[x]+COST)
               {
                   D[NODE]=D[x]+COST;
                   if(!viz[NODE])
                   {
                       viz[NODE]=true;
                       q.push(NODE);
                   }
               }
        }
    }
}
int main()
{
citire();
diji(1);
for(int i=2;i<=n;i++)
       {
           if(D[i]==oo) out<<"0"<<' ';
           else out<<D[i]<<' ';
       }

    return 0;
}