#include <bits/stdc++.h>
#include <fstream> 
using namespace std;

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

vector<pair<int, int>> L[100001];
vector<int> d(100001, 1e9);
priority_queue<pair<int, int>> pq;

int main()
{
    int n, m;
    fin >> n >> m;

    for(int i = 1; i <= m; i ++)
    {
        int x, y, w;
        fin >> x >> y >> w;

        L[x].push_back({y, w});
    }

    d[1] = 0;
    pq.push({0, 1});

    while(!pq.empty())
    {
        int node = pq.top().second;
        int dist = - pq.top().first;

        pq.pop();

        for(auto m: L[node])
        {
            int v = m.first, w = m.second;

            if(d[v] == dist) continue;

            if(d[v] > d[node] + w)
            {
                d[v] = d[node] + w;
                pq.push({-d[v], v});
            }
                
        }
    }

    for(int i = 2; i <= n; i ++)
    {
        if(d[i] == 1e9) d[i] == 0;
        fout << d[i] << ' ';
    }
}