#include <fstream>
#include <queue>
#include <vector>
#include <stack>
#include <algorithm>
using namespace std;
ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");
struct numar
{
    int nod,cost;
};
struct cmp
{
    int operator()(const numar &a,const numar &b)
    {
        return a.cost>b.cost;
    }
};
priority_queue<numar,vector<numar>,cmp>q;
int n,m,d[50005],viz[50005];
vector<pair<int,int>>l[50005];
int main()
{
    cin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int x,y,c;
        cin>>x>>y>>c;
        l[x].push_back({y,c});
    }

    for(int i=2;i<=n;i++)
        d[i]=1e9;

    q.push({1,0});
    d[1]=0;
    while(!q.empty())
    {
        int nod=q.top().nod;
        int cost=q.top().cost;
        q.pop();
        if(viz[nod])
            continue;
        viz[nod]=1;
        for(int i=0;i<l[nod].size();i++)
        {
            int vecin=l[nod][i].first;
            int nou_cost=l[nod][i].second;
            if(d[vecin]>d[nod]+nou_cost)
            {
                d[vecin]=d[nod]+nou_cost;
                q.push({vecin,d[vecin]});
            }
        }
    }
    for(int i=2;i<=n;i++)
        cout<<d[i]<<" ";
    return 0;
}