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

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

struct dd {
    int destination;
    int distance;
};

int n, m, x, y, cost;

vector<int> dijkstra(vector<vector<pair<int, int>>>& list, int start) {
    
    struct compareFuncPairMin {
        bool operator()(dd a, dd  b) const {
            return a.distance > b.distance;
        }
    };

    priority_queue<dd, vector<dd>, compareFuncPairMin> heap;
    vector<int> dist(n + 1, -1);
    vector<int> parent(n + 1, 0);

    dist[start] = 0;
    for (auto& e : list[start]) {
        dist[e.first] = e.second;
        parent[e.first] = start;
        heap.push({ e.first,dist[e.first]});
    }
    
    while (!heap.empty()) {
        dd current = heap.top();
        heap.pop();
        
        for (auto& e : list[current.destination]) {
            if (dist[e.first] == -1 || current.distance + e.second < dist[e.first]) {
                dist[e.first] = current.distance + e.second;
                parent[e.first] = current.destination;
                heap.push({ e.first,dist[e.first] });
            }
        }
    }
    return dist;
}


int main()
{
    cin >> n >> m;
    vector<vector<pair<int, int>>> list(n+1);

    for (int i = 0; i < m; i++) {
        cin >> x >> y >> cost;
        list[x].push_back({ y,cost });
        list[y].push_back({ x,cost });
    }

    vector<int> dist = dijkstra(list, 1);

    for (int i = 2; i < dist.size(); i++) {
        if (dist[i] == -1) { dist[i] == 0; }
        cout << dist[i] << " ";
    }

}