#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;

#define INF 20001

int main()
{
    ifstream in("dijkstra.in");
    ofstream out("dijkstra.out");

    int n, m, x, y, z;

    in >> n >> m;

    vector<vector<int>> g(n+1);
    vector<vector<int>> d(n+1);

    for (int i = 0; i < m; ++i)
    {
        in >> x >> y >> z;
        g[x].push_back(y);
        d[x].push_back(z);
    }

    //vector<int> vis(n+1);
    //vector<int> prev(n+1);
    vector<int> dist(n+1, INF);
    vector<int> q;

    dist[1] = 0;
    for (int v = 1; v <= n; ++v)
    {
        //dist[v] = INF;
        //prev[v] = 0;
        q.push_back(v);
    }

    while (!q.empty()) {
        int mind = INF;
        int u = -1;
        for (int i = 0; i < q.size(); ++i)
        {
            int current_node = q[i];
            if (mind > dist[current_node]) {
                mind = dist[current_node];
                u = current_node;
            }
        }

        if (u == -1) break;

        auto it = find(q.begin(), q.end(), u);
        if (it != q.end()) q.erase(it);

        for (int i = 0; i < g[u].size(); ++i) {
            int v = g[u][i];
            int weight = d[u][i];

            if (find(q.begin(), q.end(), v) != q.end()) {
                if (dist[u] + weight < dist[v]) {
                    dist[v] = dist[u] + weight;
                }
            }
        }
    }

    for (int i = 2; i <= n; ++i)
    if (dist[i] == INF)
        out << "0 ";
    else
        out << dist[i] << " ";

    in.close();
    out.close();
    return 0;
}