#include <fstream>
#include <vector>
#include <climits>
#include <queue>
using namespace std;
ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");
int n,m,d[50001];
int x,y,cost;
bool viz[50001];
struct muchie{
    int v,c;
};
struct cmp{
bool operator ()(muchie a, muchie b){
    return a.c>b.c;
}
};
vector<muchie>l[50001];
priority_queue<muchie,vector<muchie>,cmp>heep;
int main()
{
    cin>>n>>m;
    for(int i=1;i<=m;i++){
       cin>>x>>y>>cost;
       l[x].push_back({y,cost});
    }
    for(int i=2;i<=n;i++)
        d[i]=INT_MAX;

    heep.push({1,0});
    while(!heep.empty()){
        int nod=heep.top().v;
        heep.pop();
        if(viz[nod]==1)
           continue;
        viz[nod]=1;

    for(auto vec:l[nod]){
        int v=vec.v, cost=vec.c;
        if(d[v]>d[nod]+cost){
            d[v]=d[nod]+cost;
            heep.push({v,d[v]});
        }

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