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

    hp.push({1,0});//nod 1 cost 0
    while(!hp.empty()){
        int nod=hp.top().x;
        hp.pop();
        if(viz[nod]==1)
            continue;
        viz[nod]=1;
        for(auto i:v[nod]){
            int k=i.x;
            int cost=i.c;
            if(d[k]>d[nod]+cost){
                d[k]=d[nod]+cost;
                hp.push({k,d[k]});
            }
        }
    }
    for(int i=2;i<=n;i++){
        if(d[i]==INT_MAX)
            fout<<0<<" ";
        else
            fout<<d[i]<<" ";
    }
    return 0;
}