#include <fstream>
#include <vector>
#include <queue>
#define inf 1e9
#define nmax (int)(5e4+1)
using namespace std;
ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");
int n,m,x,y,c,dp[nmax];
bool viz[nmax];
struct coada{
    int x,c;
};
vector<coada>v[nmax];
struct cmp{
    bool operator()(const coada& a,const coada& b){
        return a.c>b.c;
    }
};
priority_queue<coada,vector<coada>,cmp>q;
void dijkstra(int nod){
    for(int i=1;i<=n;i++)
        dp[i]=inf;
    dp[nod]=0;
    q.push({nod,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.x]>dp[nod]+i.c){
                dp[i.x]=dp[nod]+i.c;
                q.push({i.x,dp[i.x]});
            }
    }
}
signed main()
{
    cin>>n>>m;
    for(int i=1;i<=m;i++){
        cin>>x>>y>>c;
        v[x].push_back({y,c});
    }
    dijkstra(1);
    for(int i=2;i<=n;i++){
        if(dp[i]==inf)
            dp[i]=0;
        cout<<dp[i]<<" ";
    }
    return 0;
}