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

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

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

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

int main()
{
    int x, y, i, cost;
    fin >> n >> m;
    for (i = 1; i <= m; i++)
    {
        fin >> x >> y >> cost;
        a[x].push_back({cost, y});
    }
    Dijk(1);
    for (i = 2; i <= n; i++)
        fout << d[i] << " ";
    fout << "\n";
}