#include <bits/stdc++.h>
#define oo 2000000005
using namespace std;

/**
Grafuri cu costuri - Probleme de drum minim
Alg. lui Dijkstra

i j c  h[i] = (c, j), (c1, k)
       h[j] = (c, i)


*/
           ///cost, nod
vector < pair<int, int> > h[100002];
priority_queue< pair<int, int> > q;
int n, m, P;
int d[100002]; /// d[i] = costul minim al unui drum de la P la i
int viz[100002]; /// viz[i]=1 daca s-a gasit deja drumul minim de la
              /// nodul P la nodul i
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

void Citire()
{
    int i, j, c, k;
    fin >> n >> m ;
    for (k = 1; k <= m; k++)
    {
        fin >> i >> j >> c;
        h[i].push_back({c, j});
       /// h[j].push_back({c, i});
    }
}

/// O(n log n)
void Dijkstra(int P)
{
    int i, k, c;
    for (i = 1; i <= n; i++)
        d[i] = oo;
    d[P] = 0;
    q.push({0, P});
    while (!q.empty())
    {
        k = q.top().second;
        q.pop();
        if (viz[k] == 0)
        {
            viz[k] = 1;
            /// cauta adiacentii lui k
            for (auto w : h[k])
            {
                i = w.second;
                c = w.first;
                if (d[i] > d[k] + c)
                {
                    d[i] = d[k] + c;
                    q.push({-d[i], i});
                }
            }
        }
    }
}

void Afis()
{
    int i;
    for (i = 2; i <= n; i++)
        if (d[i] == oo) fout << "-1 ";
        else fout << d[i] << " ";
}

int main()
{
    Citire();
    Dijkstra(1);
    Afis();
    return 0;
}