#include <bits/stdc++.h>

using namespace std;

vector<pair<int, int>> g[50001];
priority_queue <pair < int, int>> pq;
int dist[50001];
bool viz[50001];

int n, m;
void dijkstra(int node)
{

    for ( int i = 2; i <= n; i++)
        dist[i] = INT_MAX;

    pq.push({0, node});
    while(!pq.empty())
    {
        pair<int, int> aux = pq.top();
        pq.pop();
        if(viz[aux.second] == false)
        {
            viz[aux.second] = true;
            for( auto x:g[aux.second])
            {
                if( dist[x.second] > dist[aux.second] + x.first)
                {
                    dist[x.second] = dist[aux.second] + x.first;
                    pq.push({-dist[x.second],x.second});
                }
            }
        }
    }
}

int main()
{
    ifstream cin("dijkstra.in");
    ofstream cout("dijkstra.out");

    cin >> n >> m;
    for( int i = 1; i <= m; i++)
    {
        int a, b, c;
        cin >> a >> b >> c;
        g[a].push_back({c, b});
    }

    dijkstra(1);

    for(int i = 2; i <= n; i++)
    {
        if( dist[i] != INT_MAX )
            cout << dist[i] << " ";
        else
            cout << 0 << " ";

    }
    return 0;
}