#include <iostream>
#include <fstream>
#include <vector>
#include <utility>
#include <queue>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

vector<pair<int,int>> graf[50001];
bool vizitat[50001];
int distanta[50001];
int INFINIT=0x3f3f3f;

void dijkstra(int startNod){
    distanta[startNod]=0;
    priority_queue<pair<int,int>> q;
    q.push({distanta[startNod], startNod});
    while(q.empty()==0){
        int nod=q.top().second;
        q.pop();
        if(vizitat[nod])
            continue;
        vizitat[nod]=true;
        for(auto vecin : graf[nod]){
            if(distanta[nod]+vecin.second<distanta[vecin.first]){
                distanta[vecin.first]=distanta[nod]+vecin.second;
                q.push({-distanta[vecin.first],vecin.first});
            }
        }
    }
}

int main()
{
    int n,m;
    fin>>n>>m;
    while(m){
        int x,y,cost;
        fin>>x>>y>>cost;
        graf[x].push_back({y,cost});
        m--;
    }
    for(int i=1; i<=n; i++)
        distanta[i]=INFINIT;
    dijkstra(5);
    for(int i=2; i<=n; i++)
        if(distanta[i]!=INFINIT)
            fout<<distanta[i]<<" ";
        else
            fout<<0<<" ";
    return 0;
}