#include <iostream>
#include <fstream>
#include <set>
#include <vector>
#define MAX 50005
#define INF 1<<24
using namespace std;

ifstream f("dijkstra.in");
ofstream g("dijkstra.out");

vector< vector<pair<int, int>> > G(MAX);
vector <int> dis(MAX, INF);
set <pair <int, int> > viz;

int n, m, s = 1;

int main()
{
    f >> n >> m;
    for (int i = 0; i < m; i++)
    {
        int x, y, cost;
        f >> x >> y >> cost;
        G[x].push_back({cost, y});
    }
    dis[1] = 0;
    viz.insert({0, 1});
    while (viz.size() != 0)
    {
        int nod = viz.begin()->second;
        viz.erase(viz.begin());
        for (auto i: G[nod])
        {
            if (dis[i.second] > dis[nod] + i.first)
            {
                viz.erase({dis[i.second], i.second});
                dis[i.second] = dis[nod] + i.first;
                viz.insert({dis[i.second], i.second});

            }
        }
    }
    for (int i = 2; i <= n; i++)
    {
        if (dis[i] != INF)
            g << dis[i] << " ";
        else
            g << 0 << " ";
    }
    return 0;
}