#include <iostream>
#include <vector>
#include <fstream>
#include <bitset>
#include <algorithm>
#include <queue>
using namespace std;

ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
vector<pair<int,int>> L[50005];
int dist[50005];
void dij() {
    priority_queue <pair<int,int>, vector<pair<int,int>>, greater<pair<int,int>>> pq;
    pq.push({0,1});
    while (!pq.empty()) {
        pair<int,int> curr=pq.top();
        pq.pop();
        if (curr.first>dist[curr.second])
            continue;
        for (auto it:L[curr.second])
            if (curr.first+it.second<dist[it.first]) {
                dist[it.first]=curr.first+it.second;
                pq.push({dist[it.first],it.first});
            }
    }
}

int main() {
    int n,m;
    fin>>n>>m;
    for (int i=1; i<=m; i++) {
        int x,y,z;
        fin>>x>>y>>z;
        L[x].push_back({y,z});
    }
    for (int i=1; i<=n; i++)
        dist[i]=1e9;
    dist[1]=0;
    dij();
    for (int i=2; i<=n; i++)
        if (dist[i]!=1e9)
            fout<<dist[i]<<" ";
        else
            fout<<0<<" ";
    return 0;
}
// num=10,/=11,*=12,-=13,+=14,enter=15,.=16,