#include <fstream>
#include <algorithm>
#include <queue>
using namespace std;
ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");
int n,m,a,b,c,d[50001];
vector<pair<int,int>> v[50001];
void dij(int nod)
{
    for(int i=1;i<=n;i++)
        d[i]=2e9;
    d[nod]=0;
    priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> q;
    q.push({0,nod});
    while(!q.empty())
    {
        auto a=q.top();
        q.pop();
        if(a.first!=d[a.second])
            continue;
        for(auto &i:v[a.second])
        {
            if(d[i.first]>a.first+i.second)
            {
                d[i.first]=a.first+i.second;
                q.push({d[i.first],i.first});
            }
        }
    }
}
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        cin>>a>>b>>c;
        v[a].push_back({b,c});
        //v[b].push_back({a,c});
    }
    dij(1);
    for(int i=2;i<=n;i++)
    {
        if(d[i]==2e9)
            d[i]=0;
        cout<<d[i]<<' ';
    }
    return 0;
}