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