#include <fstream>
#include <vector>
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];
vector<int> c;
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);
    }
    c.push_back(1);
    int st = 0;
    while (st < c.size()) {
        int a = c[st];
        for (int i = 0; i < v[a].size(); ++i) {
            int b = v[a][i];
            if (s[b] == 0 || s[a] + cs[a][i] < s[b]) {
                s[b] = s[a] + cs[a][i];
                c.push_back(b);
            }
        }
        st++;
    }
    for (int i = 2; i <= n; ++i) {
        fout << s[i] << ' ' ;
    }
    fout.close();
    return 0;
}