#include <fstream>
#include <vector>
#include <queue>
#include <climits>

using namespace std;

ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");

int n, m, dmin[50005], viz[50005];
struct TNod{
    int dest, cost;
};

class ComparisonClass {
public:
    bool operator() (TNod a, TNod b) {
        return a.cost > b.cost;
    }
};

priority_queue <TNod, vector <TNod>, ComparisonClass> pq;
vector <TNod> graf[50005];

void djikstra(int nod) {
    while (!pq.empty()) {
        nod = pq.top().dest;
        pq.pop();
        if (!viz[nod]) {
            viz[nod]++;
            for (int i = 0; i < graf[nod].size(); i++) {
                if (!viz[graf[nod][i].dest] && dmin[graf[nod][i].dest] > dmin[nod] + graf[nod][i].cost) {
                    dmin[graf[nod][i].dest] = dmin[nod] + graf[nod][i].cost;
                    pq.push({graf[nod][i].dest, dmin[graf[nod][i].dest]});
                }
            }
        }
    }
}

int main()
{
    int x, y, c;
    cin >> n >> m;
    for (int i = 0; i < m; i++) {
        cin >> x >> y >> c;
        graf[x].push_back({y, c});
    }
    for (int i = 2; i <= n; i++) {
        dmin[i] = INT_MAX;
    }
    pq.push({1,0});
    djikstra(1);
    for (int i = 2; i <= n; i++) {
        if (!viz[i]) cout << 0 << " ";
        else cout << dmin[i] << " ";
    }
    return 0;
}