#include <fstream>
#include <vector>
#include <queue>
#include <iostream>

using namespace std;

const int INF = 0x3f3f3f3f;

vector< pair<int, int> > g[50002];
priority_queue< pair<int, int> > q;
int d[50002];
bool vis[50002];

int main()
{
    ifstream in("dijkstra.in");
    ofstream out("dijkstra.out");

    int n, m;
    in >> n >> m;

    for (int i = 1; i <= n; i++)
        d[i] = INF;

    for (int i = 1; i <= m; i++)
    {
        int x, y, c;
        in >> x >> y >> c;
        g[x].push_back(make_pair(y, c));
    }
    d[1] = 0;
    q.push(make_pair(0, 1));

    while (!q.empty())
    {
        int node = q.top().second;
        q.pop();
        if (vis[node])
            continue;
        vis[node] = true;
        for (int i = 0; i < g[node].size(); i++)
            if (!vis[g[node][i].first] && d[g[node][i].first] > d[node] + g[node][i].second)
            {
                d[g[node][i].first] = d[node] + g[node][i].second;
                q.push(make_pair(-d[g[node][i].first], g[node][i].first));
            }
    }

    for (int i = 2; i <= n; i++)
        if (vis[i])
            out << d[i] << ' ';
        else
            out << "0 ";
    out << '\n';

    return 0;
}