#include <iostream>
#include <fstream>
#include <queue>
#include <climits>
using namespace std;

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

int const Vmax = 50001;
priority_queue<pair<int, int>> Q;
vector<pair<int, int>> v[Vmax];
vector<int> dist(Vmax, INT_MAX);

void bfs()
{
    dist[1] = 0;
    Q.push({0, 1});
    while (!Q.empty())
    {
        int vec = Q.top().second;
        int distanta_vec = -Q.top().first;
        Q.pop();
        if (distanta_vec < dist[vec])
            continue;
        for (pair<int, int> i : v[vec])
        {
            if (dist[i.second] > dist[vec] + i.first)
            {
                dist[i.second] = dist[vec] + i.first;
                Q.push({-dist[i.second], i.second});
            }
        }
    }
}

int main()
{
    int n, m;
    fin >> n >> m;
    for (int i = 1; i <= m; i++)
    {
        int x, y, z;
        fin >> x >> y >> z;
        v[x].push_back({z, y});
    }
    bfs();
    for (int i = 2; i <= n; i++)
    {
        if (dist[i] == INT_MAX)
            dist[i] = 0;
        fout << dist[i] << " ";
    }
    return 0;
}