#include<fstream>
#include<vector>
#include<queue>
#define inf 1000000000000
using namespace std;
ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");
vector<vector<pair<long long,long long>> >mu;
priority_queue<pair<long long,long long>>Q;
long long n,m,x,y,c,f[50002];
long long cost[50002];
int main()
{
    cin>>n>>m;
    mu.resize(n+1);
    for(long long i=1; i<=m; i++)
    {
        cin>>x>>y>>c;
        mu[x].push_back(make_pair(c,y));
    }
    for(long long i=1; i<=n; i++)
        cost[i]=inf;
    Q.push(make_pair(0,1));
    cost[1]=0;
    while(Q.empty()==0)
    {
        long long nod=Q.top().second;
        if(f[nod]==0)
        {
            for(long long i=0; i<mu[nod].size(); i++)
                if(cost[nod]+mu[nod][i].first<cost[mu[nod][i].second])
                {
                    cost[mu[nod][i].second]=cost[nod]+mu[nod][i].first;
                    Q.push(make_pair(-cost[mu[nod][i].second],mu[nod][i].second));
                }
            f[nod]=1;
        }
        Q.pop();
    }
    for(long long i=2; i<=n; i++)
    {
        if(cost[i]!=inf)
            cout<<cost[i]<<' ';
        else
            cout<<0<<' ';
    }
}