#include <fstream>
#include <vector>
#include <set>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int n, m, x, y, c, i, j;
vector <vector <pair <int, int> > > g;
vector <int> cost;
const int oo = 1e9;
int main()
{
    fin >> n >> m; g.resize(n+1); cost.resize(n+1);
    for (i = 1; i <= m; i++)
    {
        fin >> x >> y >> c;
        g[x].push_back({y, c});
    }
    for (i = 2; i <= n; i++)
        cost[i] = oo;
    set <pair <int, int> > s;
    s.insert({0, 1});
    while (!s.empty())
    {
        x = (*s.begin()).second;
        c = (*s.begin()).first;
        s.erase(s.begin());
        for (auto it : g[x])
        {
            if (c+it.second < cost[it.first])
            {
                if (cost[it.first] != oo)
                    s.erase(s.find({cost[it.first], it.first}));
                cost[it.first] = c+it.second;
                s.insert({cost[it.first], it.first});
            }
        }
    }
    for (i = 2; i <= n; i++)
        fout << cost[i]*(cost[i] != oo) << " ";
    return 0;
}