#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[250001];
priority_queue<pair<int,int>> q;

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

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(1);
    for (i = 2 ; i <= n ; i++)
        if (d[i] != 2e9)
            fout << d[i] << " ";
        else
            fout << 0 << " ";
    return 0;
}