#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];

void Dijkstra(int source)
{
    int minn, i, k, pas, c;
    for (i = 2; i <= n; i++) d[i] = 1e9;
    for (pas = 1; pas <= n; i++)
    {
        minn = 1e9;
        k = 0;
        for (i = 1; i <= n; i++)
            if (minn > d[i] && viz[i] == 0)
            {
                k = i;
                minn = d[i];
            }
        if (minn == 1e9) return;
        viz[k] = 1;
        for (auto w : h[k])
        {
            i = w.first;
            c = w.second;
            if (d[i] > d[k] + c) d[i] = d[k] + c;
        }
    }
}

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

    return 0;
}