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

typedef pair<int, int> pii;

vector<int> Dijkstra(vector<vector<pii>>& graph, int n)
{
    vector<int> dist(n + 1, INT_MAX);
    priority_queue<pii, vector<pii>, greater<pii>> pq;

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

    while(!pq.empty())
    {
        int current_dist = pq.top().first;
        int u = pq.top().second;
        pq.pop();

        if (current_dist > dist[u]) {
            continue;
        }

        for (auto& edge : graph[u]) {
            int v = edge.first;        
            int weight = edge.second;  
            
            if (dist[u] + weight < dist[v]) {
                dist[v] = dist[u] + weight;
                pq.push({dist[v], v});
            }
        }

    } 

    return dist;
}

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

    int n,m;
    cin>>n>>m;
    vector<vector<pii>> graph(n + 1);

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

    vector<int> dist = Dijkstra(graph, n);

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

    return 0;
}

/*


5 6
1 2 1
1 4 2
4 3 4
2 3 2
4 5 3
3 5 6


*/