#include <bits/stdc++.h>

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

    return 0;
}