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

using namespace std;

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

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

void Citire()
{
    int i, j, c;
    fin >> n >> m;
    while (m--)
    {
        fin >> i >> j >> c;
        h[i].push_back({c, j});
        h[j].push_back({c, i});
    }
}

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])
        {
            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()
{
    for (int i = 2; i <= n; i++)
        if (d[i] == oo) fout << "-1 ";
        else fout << d[i] << " ";
}

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