#include <fstream>
#include <vector>
#include <set>
#include <queue>
#define dmax 2000000000
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

int n, m, i, x, y, c, D[50010],nr, ok[50010];
pair <int, int> a;
vector< pair <int, int> > L[50010];
struct cmp {
    bool operator()(pair<int, int> a, pair<int, int> b) {
        return a.first > b.first;
    }
};
priority_queue<pair<int, int>, vector< pair<int, int> >, cmp> H;;
int main()
{
    fin >> n >> m;
    for(i = 1; i <= m; i ++)
    {
        fin >> x >> y >> c;
        L[x].push_back(make_pair(c,y));
    }
    for(i = 2; i <= n; i ++){
        D[i] = dmax;
        //H.insert(make_pair(D[i], i));
    }
    D[1] = 0;
    H.push(make_pair(0, 1));
    //poz_c[++u] = D[1];
        while(!H.empty())
        {
            pair<int, int> st = H.top();
            H.pop();
            D[st.second] = st.first;

            for(i = 0 ; i < L[st.second].size(); i ++)
            {
                a = L[st.second][i];
                if(D[a.second] > D[st.second] + a.first){
                    D[a.second] = D[st.second] + a.first;
                    H.push(make_pair(D[a.second],a.second));

            }
        }

    }
    for(i = 2; i <= n; i ++)
        if(D[i] != dmax)
            fout << D[i] << " ";
        else
            fout << 0 << " ";
    return 0;
}