#include <bits/stdc++.h>
using namespace std;

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

const int INF = 1e9;

int n, m;
vector<vector<pair<int,int>>> adj;
vector<int> distv;
vector<int> state;
// 0 = not in deque
// 1 = in deque
// 2 = processed before

void desopo(int start) {
    deque<int> dq;

    distv[start] = 0;
    dq.push_back(start);
    state[start] = 1;

    while(!dq.empty()) {
        int node = dq.front();
        dq.pop_front();
        state[node] = 2;

        for(auto [next, cost] : adj[node]) {
            if(distv[next] > distv[node] + cost) {
                distv[next] = distv[node] + cost;

                if(state[next] == 0) {
                    dq.push_front(next);
                    state[next] = 1;
                }
                else if(state[next] == 2) {
                    dq.push_back(next);
                    state[next] = 1;
                }
            }
        }
    }
}

int main() {
    fin >> n >> m;

    adj.resize(n+1);
    distv.assign(n+1, INF);
    state.assign(n+1, 0);

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

    desopo(1);

    for(int i = 2; i <= n; i++) {
        if(distv[i] == INF) fout << "-1 ";
        else fout << distv[i] << " ";
    }

    return 0;
}