#include <fstream>
#include <vector>
#include <queue>
#include <climits>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
const int MAXN = 50005;
int n, m;
vector<int> v[MAXN], cs[MAXN];
int s[MAXN];
int main() {
    fin >> n >> m;
    for (int i = 1; i <= m; ++i) {
        int a, b, d;
        fin >> a >> b >> d;
        v[a].push_back(b);
        cs[a].push_back(d);
    }
    for (int i = 1; i <= n; ++i) {
        s[i] = INT_MAX;
    }
    queue<int> q;
    q.push(1);
    s[1] = 0;
    int st = 0;
    while (!q.empty()) {
        int a = q.front();
        for (int i = 0; i < v[a].size(); ++i) {
            int b = v[a][i];
            bool ok = 0;
            if (s[b] == INT_MAX) {
                ok = 1;
            }
            else if (s[a] + cs[a][i] < s[b]) {
                ok = 1;
            }
            if (ok == 1) {
                s[b] = s[a] + cs[a][i];
                q.push(b);
            }
        }
        q.pop();
    }
    for (int i = 2; i <= n; ++i) {
        fout << s[i] << ' ' ;
    }
    fout.close();
    return 0;
}