#include <bits/stdc++.h>

using namespace std;

const int NMAX = 50005;

priority_queue<pair<int, int>> pq;
vector<pair<int, int>> adj[NMAX];
int save[NMAX];

int main()
{
    ifstream cin("dijkstra.in");
    ofstream cout("dijkstra.out");
    int n, m, a, b, val;
    cin>>n>>m;

    for(int i=0; i<m; i++)
    {
        cin>>a>>b>>val;
        adj[a].push_back({b, val});
    }

    for(int i=1; i<=n; i++)
        save[i] = 21e8;
    save[1] = 0;
    pq.push({0, 1});

    while(pq.empty() == false)
    {
        int curr = pq.top().second;
        pq.pop();

        for(auto x : adj[curr])
        {
            int new_node = x.first, cost = x.second;
            if(save[new_node] > save[curr] + cost)
            {
                save[new_node] = save[curr] + cost;
                pq.push({save[new_node], new_node});
            }
        }
    }

    for(int i=2; i<=n; i++)
    {
        if(save[i] == 21e8) save[i] = 0;
        cout<<save[i]<<" ";
    }


    return 0;
}