#include <fstream>
#include <vector>
#include <queue>

#define INF 2e9

using namespace std;

ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

const int MAX_N = 50001;

struct t_muchie{
    int nod;
    int cost;
};

int main()
{
    int n,m;
    vector<t_muchie>vecini[MAX_N];
    int drum[MAX_N];
    bool viz[MAX_N] = {0};

    fin>>n>>m;
    for(int i = 1; i <= m; i++){
        int nod1, nod2, cost;
        fin>>nod1>>nod2>>cost;
        t_muchie m ={nod2,cost};
        vecini[nod1].push_back(m);
    }

    drum[1] = 0;
    for(int i = 2; i <= n; i++){
        drum[i] = INF;
    }


    priority_queue<pair<int,int>> pq;

    pq.push(make_pair(0, 1));

    while(!pq.empty()){
        int nod_curr = pq.top().second;
        pq.pop();

        if(!viz[nod_curr]){
            viz[nod_curr] = true;
            for(int i = 0; i < vecini[nod_curr].size(); i++){

                int vecin = vecini[nod_curr][i].nod;
                int cost = vecini[nod_curr][i].cost;

                if(drum[vecin] > drum[nod_curr] + cost){
                   drum[vecin] = drum[nod_curr] + cost;
                   pq.push(make_pair(-drum[vecin], vecin));
                }
            }
        }
    }
    for (int i = 2; i <= n; i++) {
        if (drum[i] == INF)
            fout << "0 ";
        else
            fout << drum[i] << ' ';
    }
    return 0;
}