#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");
const int inf=1e9;
int n,m,i,x,y,cost,nod,d[50005],vec;
bool viz[50005];
vector<pair<int,int>> v[50005];
priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> q;
int main()
{
    cin>>n>>m;
    for(i=1;i<=m;i++)
    {
        cin>>x>>y>>cost;
        v[x].push_back({y,cost});
    }
    q.push({0,1});
    while(!q.empty())
    {
        cost=q.top().first;
        nod=q.top().second;
        q.pop();
        if(!viz[nod])
        {
            viz[nod]=1;
            d[nod]=cost;
            for(auto x:v[nod])
            {
                if(!viz[x.first])
                {
                    q.push({x.second+cost,x.first});
                }
            }
        }
    }
    for(i=2;i<=n;i++)
    {
        cout<<d[i]<<' ';
    }
    return 0;
}