#include <bits/stdc++.h>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
#define int long long
const int NMAX = 50001, INF = 1e18;
vector<pair<int, int>> vec[NMAX];
int dist[NMAX], n, m;

void dijkstra(int start)
{
    for(int i = 1; i <= n; i++)
        dist[i] = INF;
    dist[start] = 0;
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
    pq.push({start, 0});
    while(!pq.empty())
    {
        auto [nod, d] = pq.top();
        pq.pop();
        if(dist[nod] < d)
            continue;
        for(auto i : vec[nod])
        {
            if(dist[i.first] > dist[nod] + i.second)
            {
                dist[i.first] = dist[nod] + i.second;
                pq.push({i.first, dist[i.first]});
            }
        }
    }
}

signed main()
{
    fin >> n >> m;
    while(m--)
    {
        int i, j, cost;
        fin >> i >> j >> cost;
        vec[i].push_back({j, cost});
    }
    dijkstra(1);
    for(int i = 2; i <= n; i++)
        fout << (dist[i] == INF ? 0 : dist[i]) << ' ';

    return 0;
}