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

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

vector<pair<int, int> > g[50005];
int n, m;
int dist[50005];


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



void solve() {
    memset(dist, -1, sizeof dist);

    priority_queue<pair<int, int> >q;
    q.push({0, 1});
    while(!q.empty()) {
        int curr = q.top().second;
        int d = q.top().first;
        q.pop();
        if(dist[curr] != -1) continue;
        dist[curr] = -d;
        for(int i = 0; i < g[curr].size(); i++)
            q.push({d-g[curr][i].second, g[curr][i].first});
    }
}

void afis() {
    for(int i = 2; i <= n; i++)
        if(dist[i] == -1)
            fout << 0 << ' ';
        else
            fout << dist[i] << ' ';
}

int main() {
    citire();
    solve();
    afis();
}