#include <bits/stdc++.h>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

int n, m, d[50001], viz[50001];
vector <pair<int, int>> G[50001];
priority_queue<pair<int, int>> q;

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

int main()
{
    int i, x, y, c;
    fin >> n >> m;
    for (i = 1 ; i <= m ; i++)
    {
        fin >> x >> y >> c;
        G[x].push_back({y, c});
    }
    Dijkstra();
    for (i = 2 ; i <= n ; i++)
        fout << d[i] << " ";
    return 0;
}