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

int const INF=1e9;
int n, m, i, a, b, c;
vector<pair<int, int>> ad[100005];
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> q;
int dist[100005];

int main()
{
    fin>>n>>m;

    for(i=1;i<=m;i++){
        fin>>a>>b>>c;
        ad[a].push_back({b, c});
    }

    for(i=2;i<=n;i++){
        dist[i]=INF;
    }

    q.push({0, 1});
    while(!q.empty()){
        int nod=q.top().second;
        int c=q.top().first;

        q.pop();

        if(c>dist[nod]){
            continue;
        }

        for(i=0;i<ad[nod].size();i++){
            int vecin=ad[nod][i].first;
            int cost=ad[nod][i].second;
            if(dist[vecin]>dist[nod]+cost){
                dist[vecin]=dist[nod]+cost;
                q.push({dist[vecin], vecin});
            }
        }
    }

    for(i=2;i<=n;i++){
        if(dist[i]==INF)
            dist[i]=0;
        fout<<dist[i]<<" ";
    }



    return 0;
}