#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <climits>
#define nmax 50005
using namespace std;

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

int n, m;
int cost[nmax];
vector < pair<int, int> > V[nmax];
queue < pair<int, int> > Q;

void read() {
    int i, a, b, c;
    fin >> n >> m;
    for (i = 2; i <= n; i++)
        cost[i] = INT_MAX;
    for (i = 1; i <= m; i++) {
        fin >> a >> b >> c;
        V[a].push_back(make_pair(b, c));
    }
}

void dijkstra() {
    int i;
    Q.push(make_pair(1, 0));
    while (!Q.empty()) {
        int nod = Q.front().first;
        int Cost = Q.front().second;
        Q.pop();
        for (i = 0; i < V[nod].size(); i++) {
            int vecinCurent = V[nod][i].first;
            int costCurent = V[nod][i].second;
            if (cost[vecinCurent] > Cost + costCurent) {
                cost[vecinCurent] = Cost + costCurent;
                Q.push(make_pair(vecinCurent, cost[vecinCurent]));
            }
        }
    }
}

void write() {
    int i;
    for (i = 2; i <= n; i++)
        if (cost[i] == INT_MAX)
            fout << 0 << " ";
        else
            fout << cost[i] << " ";
}

int main() {
    read();
    dijkstra();
    write();
    fin.close();
    fout.close();
    return 0;
}