#include <bits/stdc++.h>
#define nmax 50005
#define inf 200000005
#define cin fin
#define cout fout
using namespace std;
ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");

vector<pair<int,int>> gf[nmax];
priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> pq;
int n, m, x, y, c, p, dp[nmax], viz[nmax];

void dijkstra(int start)
{
    dp[start]=0;
    pq.push({0,start});
    while(!pq.empty())
    {
        int nod=pq.top().second;
        pq.pop();
        if(viz[nod])
            continue;
        viz[nod]=1;
        for(auto x : gf[nod])
        {
            int nnod=x.second;
            int ccost=x.first;
            if(dp[nnod]>dp[nod]+ccost)
            {
                dp[nnod]=dp[nod]+ccost;
                pq.push({dp[nnod],nnod});
            }
        }
    }
}

int main()
{
    cin>>n>>m;
    while(m--)
    {
        cin>>x>>y>>c;
        gf[x].push_back({c,y});
    }
    for(int i=1; i<=n; i++)
        dp[i]=inf;
    dijkstra(1);
    for(int i=2; i<=n; i++)
        if(dp[i]==inf)
            cout<<0<<' ';
        else cout<<dp[i]<<' ';
}