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

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

int n, m, a, b, c;
vector<pair<int, int>> graf[50001];
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;

int main()
{
    fin>>n>>m;
    for (int i=1; i<=m; i++)
    {
        fin>>a>>b>>c;
        graf[a].push_back({b, c});
    }
    vector<int> dist(50001, INT_MAX);
    dist[1]=0;
    pq.push({0, 1});
    while (!pq.empty())
    {
        int d=pq.top().first;
        int u=pq.top().second;
        pq.pop();
        if (d<=dist[u])
        {
            for (auto [v, cost]: graf[u])
            {
                if (dist[v]>dist[u]+cost)
                {
                    dist[v]=dist[u]+cost;
                    pq.push({dist[v], v});
                }
            }
        }
    }
    for (int i=2; i<=n; i++)
    {
        if (dist[i]==INT_MAX)
        {
            fout<<0<<" ";
        }
        else
        {
            fout<<dist[i]<<" ";
        }
    }
    

    return 0;
}