#include <fstream>
#include <queue>
#include <vector>
#define dim 50002
#define inf 1e9
using namespace std;
ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");

int n,m;
int d[dim],sel[dim];
vector<pair<int,int>>a[dim];  //a[x] are muchii  (x,y) <y,cost>

priority_queue<int,vector<int>,greater<int> >Q;   // min heap Q <nod>

void dijkstra(){
    for(int i=2;i<=n;++i) d[i]=inf;
    sel[1]=1;
    Q.push(1);
    while(!Q.empty()){
        int nod=Q.top();
        sel[nod]=0;
        Q.pop();

        for(auto vec:a[nod]){
            int nbr=vec.first;
            int cst=vec.second;

            if(d[nbr]>cst+d[nod]){
               d[nbr]=cst+d[nod];
                if(!sel[nbr]) Q.push(nbr),sel[nbr]=1;
            }
        }
    }

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

int main()
{
    cin>>n>>m;
    for(;m;--m){
        int x,y,c;
        cin>>x>>y>>c;
        a[x].push_back({y,c});
    }

    dijkstra();

    return 0;
}