#include <bits/stdc++.h>
using namespace std;

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

int n, m;
int d[50005], viz[50005];
vector<pair<int, int>> L[50005];
priority_queue<pair<int, int>> q;

void Dijkstra()
{
    for (int i = 1; i <= n; i++)
        d[i] = 2e9;
    d[1] = 0;
    q.push({0, 1});
    while (!q.empty())
    {
        int k = q.top().second;
        q.pop();
        if (viz[k] == 0)
        {
            viz[k] = 1;
            for (auto w : L[k])
                if (d[w.second] > d[k] + w.first)
                {
                    d[w.second] = d[k] + w.first;
                    q.push({-d[w.second], w.second});
                }
        }

    }
}

int main()
{
    int i, j, c;
    fin >> n >> m;
    while (m--)
    {
        fin >> i >> j >> c;
        L[i].push_back({c, j});
    }
    Dijkstra();
    for (i = 2; i <= n; i++)
        if (d[i] == 2e9) fout << "0 ";
        else fout << d[i] << " ";
    return 0;
}