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

using namespace std;

int dis[MAX];
bitset<MAX> viz;

struct cmp {
    bool operator ()(int a, int b) {
        return dis[a] > dis[b];
    }
};

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

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

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(1);
    int top;
    vector<pair<int, int>>::iterator it;

    while(!que.empty()) {

        top = que.top();
        //cout << top << '\n';
        que.pop();

        if(viz[top])
            continue;

        for(it = vec[top].begin(); it != vec[top].end(); it++) {
            if(!viz[it->first] && dis[top]+(*it).second < dis[(*it).first]) {
                que.push(it->first);
                dis[it->first] = (*it).second+dis[top];
            }
        }

    }

    //cout << '\n';

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

    return 0;
}