#include <bits/stdc++.h>

using namespace std;

const int INF = 2e9;

int n, m, u, v, c;
vector<int> dp;
vector<vector<pair<int, int>>> adj;

class InParser {
    private:
        vector<char> str;
        int ptr;
        ifstream fin;
    
    private:
        char get_char() {
            if (ptr == (int)str.size()) {
                fin.read(str.data(), (int)str.size());
                ptr = 0;
            }

            return str[ptr++];
        }

        template<class T>
        T get_int() {
            char chr;
            do {
                chr = get_char();
            } while (!isdigit(chr) && (chr != '-'));

            int sgn = +1;
            if (chr == '-') {
                sgn = -1;
                chr = get_char();
            }

            T num = 0;
            while (isdigit(chr)) {
                num = num * 10 + (chr - '0');
                chr = get_char();
            }

            return sgn * num;
        }

    public:
        InParser(const char *name) : str((int)1e5), ptr((int)str.size()), fin(name) { }
        ~InParser() { fin.close(); }

        template<class T>
        friend InParser &operator >> (InParser &in, T &num) {
            num = in.get_int<T>();
            return in;
        }
};

class OutParser {
    private:
        vector<char> str;
        int ptr = 0;
        ofstream fout;
    
    private:
        void put_char(char chr) {
            if (ptr == (int)str.size()) {
                fout.write(str.data(), (int)str.size());
                ptr = 0;
            }

            str[ptr++] = chr;
        }

        template<class T>
        void put_int(T num) {
            if (num < 0) {
                put_char('-');
                num *= -1;
            }

            if (num > 9)
                put_int(num / 10);
            put_char(num % 10 + '0');
        }

    public:
        OutParser(const char *name) : str((int)1e5), ptr(0), fout(name) { }
        ~OutParser() { fout.write(str.data(), ptr); fout.close(); }

        template<class T>
        friend OutParser &operator << (OutParser &out, const T num) {
            out.put_int(num);
            return out;
        }

        friend OutParser &operator << (OutParser &out, const char chr) {
            out.put_char(chr);
            return out;
        }

        friend OutParser &operator << (OutParser &out, const char *str) {
            for (int i = 0; str[i]; i++)
                out.put_char(str[i]);
            return out;
        }
};

InParser fin("dijkstra.in");
OutParser fout("dijkstra.out");
// InParser fin("in.txt");
// OutParser fout("out.txt");

void citire() {
    fin >> n >> m;
    dp.resize(n + 1, INF);
    adj.resize(n + 1);
    while (m--) {
        fin >> u >> v >> c;
        adj[u].push_back(make_pair(v, c));
    }
}

void dijkstra(int start = 1) {
    priority_queue<pair<int, int>> q;
    dp[start] = 0;
    q.push(make_pair(start, 0));
    while (!q.empty()) {
        int x, y, w, z;
        x = q.top().first;
        y = q.top().second;
        q.pop();

        if (y > dp[x])
            continue;
        
        for (auto it : adj[x]) {
            w = it.first;
            z = it.second;

            if (dp[w] > y + z) {
                dp[w] = y + z;
                q.push(make_pair(w, dp[w]));
            }
        }
    }
}

void afis() {
    for (int i = 2; i <= n; i++)
        fout << (dp[i] == INF? 0 : dp[i]) << ' ';
    fout << '\n';
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    citire();
    dijkstra();
    afis();

    return 0;
}