#include <bits/stdc++.h>

using namespace std;

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

const int NMAX = 50005;
const int oo = 2000000000;
vector < pair <int, int> >graph[NMAX];
bitset<NMAX>seen;
priority_queue < pair <int, int> > pq;
int n, m, dist[NMAX];

int main()
{
    int i, j, x, y, v;
    fin >> n >> m;
    for(i = 1;i <= m;i++)
    {
        fin >> x >> y >> v;
        graph[x].push_back({y, v});
    }
    for(i = 1;i <= n;i++)
        dist[i] = oo;
    dist[1] = 0;
    pq.push({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({-dist[x.first], x.first});
                }
            }
        }
    }
    for(i = 2;i <= n;i++)
    {
        if(dist[i] == oo)
            dist[i] = 0;
        fout << dist[i] << " ";
    }
    return 0;
}