#include <bits/stdc++.h>
using namespace std;
const int NMAX = 50004;

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

int n, m;
int s = 1;
vector<pair<int, int>> adj[NMAX];
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> Q;
vector<int> d;

void dijkstra()
{
    d.assign(n + 1, INT_MAX);
    d[s] = 0;
    Q.push({0, s});
    while (!Q.empty())
    {
        int v = Q.top().second;
        int d_v = Q.top().first;
        Q.pop();
        if (d_v != d[v])
        {
            continue;
        }
        for (auto edge : adj[v])
        {
            int u = edge.first;
            int cost = edge.second;
            if (d[v] + cost < d[u])
            {
                d[u] = d[v] + cost;
                Q.push({d[u], u});
            }
        }
    }
}

int main()
{
    fin >> n >> m;
    for (int i = 1; i <= m; i++)
    {
        int a, b, c;
        fin >> a >> b >> c;
        adj[a].push_back({b, c});
    }
    dijkstra();
    for (int i = 2; i <= n; i++)
    {
        fout << d[i] << ' ';
    }
    fin.close();
    fout.close();
    return 0;
}