#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <tuple>
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
int n,x,y,m,c,d[50001];



const int INF =9999999;
int main()
{
    f>>n>>m;
    vector <vector<pair<int,int>>> l(n+1);
    for(int i=1;i<=m;++i)
    {
       f>>x>>y>>c;
        l[x].push_back({y,c});

    }

    for(int i=1;i<=n;++i)
    {

        d[i]=INF;
    }
    priority_queue<pair<int,int>, vector<pair<int,int>>, greater<pair<int,int>>> pq;
    d[1]=0;
    pq.push({0,1});

    while(!pq.empty())
    {
        int cost =pq.top().first;
        int u= pq.top().second;
        pq.pop();
        if(cost>d[u])
            continue;
        for(auto vecin: l[u])
        {
            int cost_vecin=vecin.second;
            int vecin_nod = vecin.first;
            if(d[vecin_nod]>d[u]+cost)
            {
                d[vecin_nod]=d[u]+cost_vecin;
                pq.push({d[vecin_nod],vecin_nod});
            }
        }

    }
    for(int i=2;i<=n;++i)
        g<<d[i]<<' ';

    return 0;
}