#include <bits/stdc++.h>

using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
vector <pair<int,int>> v[50001];
priority_queue < pair<int,int>, vector<pair<int,int>>, greater <pair<int,int>>> pq;
int n,m,nod,x,y,c,d[50001],cost;
int main()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y>>c;
        v[x].push_back({y,c});
    }
    for(int i=1;i<=n;i++)d[i]=INT_MAX;
    d[1]=0;
    pq.push({1,d[1]});
    while(!pq.empty())
    {
        nod=pq.top().first;
        cost=pq.top().second;
        for(int i=0;i<v[nod].size();i++)
        {
            if(v[nod][i].second+cost<d[v[nod][i].first])
            {
                d[v[nod][i].first]=v[nod][i].second+cost;
                pq.push({v[nod][i].first,v[nod][i].second});
            }
        }
        pq.pop();
    }
    for(int i=2;i<=n;i++)fout<<d[i]<<" ";
    return 0;
}