#include <fstream>
#include <vector>
#include <climits>
#include <queue>

using namespace std;

int n, m, ld[50005]; bool sel[50005];
vector<pair<int,int>> ad[50005]; priority_queue<pair<int,int>> q;

int main()
{
    ifstream cin("dijkstra.in");
    ofstream cout("dijkstra.out");
    cin >> n >> m;
    for (int i = 0; i < m; i++)
    {
        int x, y, z;
        cin >> x >> y >> z;
        ad[x].push_back({y,z});
    }
    for (int i = 1; i <= n; i++)
    {
        ld[i] = INT_MAX / 2;
    }
    ld[0] = 0; q.push({0,1});
    while (q.size())
    {
        auto c = q.top();
        q.pop();
        c.first = -c.first;
        if (sel[c.second])
            continue;
        sel[c.second] = 1;
        for (auto it:ad[c.second])
        {
            if (c.first+it.second < ld[it.first])
            {
                ld[it.first] = c.first+it.second;
                q.push({-ld[it.first], it.first});
            }
        }
    }
    for (int i = 2; i <= n; i++)
    {
        if (ld[i] == INT_MAX/2)
            ld[i] = 0;
        cout << ld[i] << " ";
    }
    return 0;
}