#include <fstream>
#include <vector>
#include <queue>
#include <iostream>
using namespace std;
#define INF 2000000000

struct Nod{
    unsigned int nod, cost;
};
vector< vector<Nod> > Graph;
vector<unsigned int> Cost;
vector<bool> Visited;
int n, m, s;

void Read(){
    ifstream f ("dijkstra.in");
    f >> n >> m;
    s = 1;
    Graph.resize(n+1);
    int a, b, c;
    Nod temp;
    for(int i = 1; i <= m; ++i){
        f >> a >> b >> c;
        temp.nod = b; temp.cost = c;
        Graph[a].push_back(temp);
    }
    f.close();
}
void Dijkstra(){
    queue<unsigned int> Que;
    Visited.resize(n+1, 0);
    Visited[1] = 1;
    Cost.resize(n+1, INF);
    Cost[1] = 0;
    Que.push(s);
    vector<Nod>::iterator it;

    while(!Que.empty()){
        for(it = Graph[Que.front()].begin(); it != Graph[Que.front()].end(); ++it){
            if(Cost[(*it).nod] > Cost[Que.front()] + (*it).cost){
                Cost[(*it).nod] = Cost[Que.front()] + (*it).cost;
                Visited[(*it).nod] = 1;
                Que.push((*it).nod);
            }
        }
        Que.pop();
    }
}
void Write(){
    ofstream g ("dijkstra.out");
    for(int i = 2; i <= n; ++i){
        if(Cost[i] == INF) g << "0 ";
        else g << Cost[i] << " ";
    }
    g << "\n";
    g.close();
}
int main(){
    Read();
    Dijkstra();
    Write();
}