#include <fstream>
#include <vector>
#include <queue>
#define N 50001
using namespace std;
ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");
int n, m, dist[N];
vector<pair<int, int>> V[N];
const int INF = (1<<31)-1; bool frv[N];
priority_queue<pair<int, int>, vector<pair<int, int> >, greater<pair<int, int> > > Q;
void Dijkstra(int x){
    Q.push({0, x});
    for(int i=1; i<=n; i++)
        dist[i] = INF;
    dist[x] = 0;

    while(!Q.empty()){
        int nod = Q.top().second;
        Q.pop();
        if(frv[nod] == true)
            continue;
        else frv[nod] = true;
        for(int i=0; i<V[nod].size(); i++){
            int v = V[nod][i].first, c = V[nod][i].second;
            if( dist[v] > dist[nod] + c){
                dist[v] = dist[nod] + c;
                Q.push({dist[v], v});
            }
        }
    }
    for(int i=2; i<=n; i++){
        if(dist[i] != INF)
            cout << dist[i] << ' ';
        else
            cout << 0 << ' ';
    }
}
int main()
{
    cin >> n >> m;
    for(int i=1; i<=m; i++){
        int x1, x2, cost;
        cin >> x1 >> x2 >> cost;
        V[x1].push_back({x2, cost});
    }
    Dijkstra(1);
    return 0;
}