#include <bits/stdc++.h>

using namespace std;

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

const int INF = (1 << 30);

int main()
{
    int n, m;
    fin >> n >> m;

    vector<vector<pair<int, int>>> v(n + 1);
    vector<int> dist(n + 1, INF);
    vector<bool> vis(n + 1);
    dist[1] = 0;

    for (int i = 1; i <= m; i++)
    {
        int x, y, c;
        fin >> x >> y >> c;
        v[x].emplace_back(y, c);
    }

    priority_queue<pair<int, int>> q;

    q.emplace(0, 1);

    while (!q.empty())
    {
        int nod = q.top().second;
        q.pop();


        if (!vis[nod])
        {
            vis[nod] = true;

            for (auto i: v[nod])
            {
                if (dist[nod] + i.second < dist[i.first])
                {
                    dist[i.first] = dist[nod] + i.second;
                    q.emplace(-dist[i.first], i.first);
                }
            }
        }
    }

    for (int i = 2; i <= n; i++)
    {
        if (dist[i] == INF)
            fout << "0 ";
        else
            fout << dist[i] << " ";
    }
    return 0;
}