#include <fstream>
#include <vector>
#include <queue>
#include <climits>
#define dim (int)(5e4+1)
using namespace std;
ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");
int n,m,x,y,c,d[dim];
bool viz[dim];
vector<pair<int,int>>v[dim];
struct cmp{
    bool operator()(const pair<int,int>& a,const pair<int,int>& b){
        return a.second>b.second;
    }
};
priority_queue<pair<int,int>,vector<pair<int,int>>,cmp>q;
void Dijkstra(){
    for(int i=2;i<=n;i++)
        d[i]=INT_MAX;
    q.push({1,0});
    while(!q.empty()){
        int nod=q.top().first;
        q.pop();
        if(viz[nod])
            continue;
        viz[nod]=1;
        for(auto i:v[nod])
            if(!viz[i.first]&&d[i.first]>d[nod]+i.second){
                d[i.first]=d[nod]+i.second;
                q.push({i.first,d[i.first]});
            }
    }
    for(int i=2;i<=n;i++){
        if(d[i]==INT_MAX)
            d[i]=0;
        cout<<d[i]<<" ";
    }
}
int main()
{
    cin>>n>>m;
    for(int i=1;i<=m;i++){
        cin>>x>>y>>c;
        v[x].push_back({y,c});
    }
    Dijkstra();
    return 0;
}