#include <fstream>
#include <vector>
#include <set>
using namespace std;

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

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

const int NMAX=50005;
const int INF = 0x3f3f3f3f;

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


void solve(){
    for(int i=2; i<=n; i++)
        dmin[i]=INF;
    Q.insert({1,0});
    while(!Q.empty()){
        int x=Q.begin() -> y;
        Q.erase(Q.begin());
        for(auto &v:graph[x]){
            if(dmin[v.y] > dmin[x]+v.cost){
                if(dmin[v.y] != INF)
                    Q.erase({v.y, dmin[v.y]});
                dmin[v.y]=dmin[x]+v.cost;
                Q.insert({v.y, dmin[v.y]});
            }
        }
    }
    for(int i=2; i<=n; i++)
        g<<dmin[i]<<" ";
}
int main()
{
    f>>n>>m;
    for(int i=1; i<=m; i++){
        f>>x>>y>>c;
        graph[x].push_back({y, c});
    }
    solve();
    return 0;
}