#include <fstream>
#include <vector>
#include <queue>
#include <iostream>
#define NMax 50005
#define oo 250005

using namespace std;

ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

int n, m, viz[NMax], dist[NMax];
vector < pair < int, int > > G[NMax];

struct prior
{
    bool operator()(int x, int y)
    {
        return dist[x] > dist[y];
    }
};

priority_queue <int, vector<int>, prior> q;

void read(){
    fin >> n >> m;
    int x, y, c;
    for(int i = 1; i <= m; ++i){
        fin >> x >> y >> c;
        G[x].push_back(make_pair(y, c));
    }
}

void dijkstra(){
    for(int i = 2; i <= n; ++i)
        dist[i] = oo;
    dist[1] = 0;
    q.push(1);
    viz[1] = 1;
    while(!q.empty()){
        int curent = q.top();
        q.pop();
        viz[curent] = 0;
        for(int i = 0; i < G[curent].size(); ++i){
            int vecin = G[curent][i].first;
            int cost = G[curent][i].second;
            if(dist[vecin] > dist[curent] + cost){
                dist[vecin] = dist[curent] + cost;
                if(viz[vecin] == 0){
                    q.push(vecin);
                    viz[vecin] = 1;
                }
            }
        }
    }
}

void print(){
    for(int i = 2; i <= n; ++i)
        if(dist[i] == oo)
            fout << "0 ";
        else
            fout << dist[i] << " ";
}

int main(){

    read();
    dijkstra();
    print();
    fin.close();
    fout.close();
    return 0;
}