#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <string.h>

#define mp make_pair
#define x first
#define y second

using namespace std;

ifstream fin ("dijkstra.in");
ofstream fout ("dijkstra.out");

vector<pair<int, int>> G[100005];
priority_queue<pair<long long, int>> q;

int n, m, viz[100005];
long long dist[100005];
void dijkstra (int s)
{
    q.push(mp(0, s));
    while (!q.empty())
    {
        int c = q.top().y;
        long long d = -q.top().x;
        q.pop();

        if (viz[c]) continue;
        viz[c] = 1;
        dist[c] = d;

        for (int i = 0; i < G[c].size(); i++)
            q.push(mp(-(d + G[c][i].y), G[c][i].x));
    }
}

int main()
{
    fin >> n >> m;
    for (int i = 1; i <= m; i++)
    {
        int x, y, d;
        fin >> x >> y >> d;
        G[x].push_back(mp(y, d));
    }
    dijkstra(1);
    for (int i = 2; i <= n; i++)
        fout << dist[i] << " ";
    return 0;
}