#define NMAX 50005
#define INF 0x3f3f3f3f
#include <fstream>
#include <vector>
#include <set>
using namespace std;

ifstream f("dijkstra.in");
ofstream g("dijkstra.out");


struct nod{
    int y, cost;
    bool operator<(const nod &other) const{
        if(cost==other.cost)
            return y<other.y;
        return cost<other.cost;
    }
};

int n, m, x, y, c;
vector<nod>graph[NMAX];
set<nod>Q;
int dmin[NMAX];

void citire(){
    f>>n>>m;
    for(int i=1; i<=m; i++){
        f>>x>>y>>c;
        graph[x].push_back({y, c});
    }
    for(int i=2; i<=n; i++)
        dmin[i]=INF;
}

void dijkstra(int st){
    Q.insert({st, 0});
    while(!Q.empty()){
        int el = Q.begin()->y;
        Q.erase(Q.begin());
        for(auto &v:graph[el]){
            if(dmin[v.y] > dmin[el] + v.cost){
                if(dmin[v.y]!=INF)
                    Q.erase({v.y, INF});
                dmin[v.y] = dmin[el] + v.cost;
                Q.insert({v.y, dmin[v.y]});
            }
        }
    }
}

void afisare(){
    for(int i=2;i<=n;i++){
        if(dmin[i] == INF)
            dmin[i] = 0;
        g<<dmin[i]<<" ";
    }
}
int main()
{
    citire();
    dijkstra(1);
    afisare();
    return 0;
}