#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <limits.h>
#include <bitset>
#define MAX 50003

using namespace std;

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

vector<pair<int, int>> vec[MAX];
vector<pair<int, int>> que;
int dis[MAX];

int main() {

    int n,m,a,b,c;
    in >> n >> m;

    for(int i = 0; i < m; i++) {
        in >> a >> b >> c;
        vec[a].push_back(make_pair(b, c));
    }

    for(int i = 1; i <= n; i++)
        dis[i] = INT_MAX;
    dis[1] = 0;
    que.push_back(make_pair(0, 1));
    int nod;
    int dist;
    vector<pair<int, int>>::iterator it;

    while(!que.empty()) {

        push_heap(que.begin(), que.end());
        dist = -(que.begin()->first);
        nod = que.begin()->second;
        pop_heap(que.begin(), que.end());
        que.pop_back();

        for(it = vec[nod].begin(); it != vec[nod].end(); it++) {
            if(dist + it->second < dis[it->first]) {
                dis[it->first] = dist + it->second;
                que.push_back(make_pair(-(dist + it->second), it->first));
            }
        }

    }

    for(int i = 2; i <= n; i++) {
        if(dis[i] != INT_MAX)
            out << dis[i] << " ";
        else
            out << 0 << " ";
    }

    return 0;
}