#include <fstream>
#include <vector>
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
const int NMAX = 50004, inf = 20000 * 50000;
int m, n;
bool fr[NMAX];
struct mu {
    int to, c;
};
vector<mu> v[NMAX];

int main() {
    f >> n >> m;
    for(int i = 0; i < m; i++) {
        int x, y, z;
        f >> x >> y >> z;
        v[x].push_back({y, z});
    }
    vector<int> d(NMAX, inf);
    d[1] = 0; fr[1] = 1;
    for(mu i : v[1])
        d[i.to] = i.c;
    for(int i = 1; i < n; i++) {
        int ind = 0;
        for(int i = 1; i <= n; i++)
            if(!fr[i] && d[i] < d[ind])
                ind = i;
        if(ind) {
            fr[ind] = 1;
            for (mu j: v[ind])
                if (d[j.to] > d[ind] + j.c)
                    d[j.to] = d[ind] + j.c;
        }
    }
    for(int i = 2; i <= n; i++)
        g << d[i] << ' ';
}