#include <bits/stdc++.h>

using namespace std;

const int NMAX = 50005;
const int INF = (1 << 30);
int N, M, dist[NMAX];
priority_queue < pair <int, int> > pq;
vector < pair <int, int> > graph[NMAX];
bitset <NMAX> seen;

int main()
{
    ifstream fin("dijkstra.in");
    ofstream fout("dijkstra.out");
    fin >> N >> M;
    for (int i = 1;i <= M;++i)
    {
        int u, v, c;
        fin >> u >> v >> c;
        graph[u].push_back(make_pair(v, c));
    }
    for (int i = 1;i <= N;++i)
        dist[i] = INF;
    dist[1] = 0;
    pq.push(make_pair(0, 1));
    while (!pq.empty())
    {
        int node = pq.top().second;
        pq.pop();
        if (seen[node] == 0)
        {
            seen[node] = 1;
            for (auto& x : graph[node])
                if (dist[x.first] > dist[node] + x.second)
                {
                    dist[x.first] = dist[node] + x.second;
                    pq.push(make_pair(-dist[x.first], x.first));
                }
        }
    }
    for (int i = 2;i <= N;++i)
        fout << dist[i] << " ";
    fin.close();
    fout.close();
    return 0;
}