#include <bits/stdc++.h>
#define oo 2000000005

using namespace std;

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

int n, m, viz[50005], d[50005];
vector < pair<int, int> > h[50005];
priority_queue < pair<int ,int> > q;

void Dijkstra(int source)
{
    int minn, i, k, pas, c;
    for (i = 2; i <= n; i++) d[i] = oo;
    q.push({0, 1});
    while (!q.empty())
    {
        k = q.top().second;
        q.pop();
        if (viz[k] == 0)
        {
            viz[k] = 1;
            for (auto w : h[k])
            {
                c = w.first;
                i = w.second;
                if (d[i] > d[k] + c)
                {
                    d[i] = d[k] + c;
                    q.push({-d[i], i});
                }
            }
        }
    }
}

int main()
{
    int x, y, c, i;
    fin >> n >> m;
    while (m--)
    {
        fin >> x >> y >> c;
        h[x].push_back({c, y});
    }
    Dijkstra(1);
    for (i = 2; i <= n; i++)
        if (d[i] == oo) fout << "-1 ";
        else fout << d[i] << " ";

    return 0;
}