#include <iostream>
#include <bits/stdc++.h>
#include <queue>
#include <fstream>
#define infinit 1000000001
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
vector <pair<int,int>>v[50001];
priority_queue<int,vector<pair<int,int>>,greater<pair<int,int>>>q;
int n,m,d[50001],i,x,y,c,nod,cost;
int main()
{
    fin>>n>>m;
    for(i=1; i<=m; i++)
    {
        fin>>x>>y>>c;
        v[x].push_back({y,c});
    }
    for(i=0; i<=n; i++) d[i]=infinit;
    d[1]=0;
    q.push({1,0});
    while(!q.empty())
    {
        nod=q.top().first;
        q.pop();
        for(auto x:v[nod])
        {
            y=x.first;
            cost=x.second;
            if(d[y]>d[nod]+cost)
            {
                d[y]=d[nod]+cost;
                q.push({y,d[y]});
            }
        }
    }
    for(i=2; i<=n; i++) fout<<d[i]<<" ";
    return 0;
}