#include <iostream>
#include <random>
#include <fstream>
#include <stack>
#include <queue>
using namespace std;

ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int n, m;
vector<pair<int, int>> L[50005];
int dist[50005];
priority_queue < pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>>pq;
void dij()
{
    pq.push({ 0,1 });
    dist[1] = 0;
    while (!pq.empty())
    {
        pair<int, int> curr = pq.top();
        pq.pop();
        if (dist[curr.second] < curr.first)
            continue;   
        for (auto it : L[curr.second])
            if (dist[it.first] > curr.first + it.second)
            {
                dist[it.first] = curr.first + it.second;
                pq.push({ curr.first + it.second, it.first });
            }
    }
}
int main() 
{
    fin >> n >> m;
    for (int i = 1; i <= m; i++)
    {
        int x, y, c;
        fin >> x >> y >> c;
        L[x].push_back({ y,c });
    }
    for (int i = 1; i <= n; i++)
        dist[i] = 2e9;
    dij();
    for (int i = 2; i <= n; i++)
    {
        if (dist[i] == 2e9)
            fout << 0 << " ";
        else
            fout << dist[i] << " ";
    }
    return 0;
}