#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");

bool cmp(pair<int, int> a, pair<int, int> b) {
    return a.second > b.second;
}

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

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

    while(!que.empty()) {

        top = que.top();
        que.pop();

        if(viz[top.first])
            continue;

        for(it = vec[top.first].begin(); it != vec[top.first].end(); it++) {

            if(!viz[(*it).first] && (*it).second+top.second < dis[(*it).first]) {
                que.push(make_pair((*it).first, (*it).second+top.second));
                dis[(*it).first] = (*it).second+top.second;
            }

        }

    }

    for(int i = 2; i <= n; i++)
        out << dis[i] << " ";

    return 0;
}