#include <bits/stdc++.h>

using namespace std;

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

const int oo = 100000000;
int n, m, d[110];
bitset<110> in_set;
vector<pair<int, int> > v[110]; /// cost, pana la nodul
set<pair<int, int> > s;
pair<int, int> top;

int main()
{
    int x, y, cost, nod;
    fin >> n >> m;
    while(fin >> x >> y >> cost)
        v[x].push_back(make_pair(cost, y));
    for(int i=1; i<=n; i++) d[i] = oo;
    d[1] = 0;
    s.insert(make_pair(0, 1));
    in_set[1] = 1;
    while(!s.empty())
    {
        top = *s.begin();
        s.erase(s.begin());
        in_set[top.second] = 0;
        for(auto vec:v[top.second])
        {
            nod=vec.second;
            cost=vec.first;
            if(d[nod] > d[top.second] + cost)
            {
///                if(in_set[nod])
///                    s.erase(s.find(make_pair(cost, nod)));
                d[nod] = d[top.second] + cost;
                s.insert(make_pair(d[nod], nod));
                in_set[nod] = 1;
            }
        }
    }
    for(int i=2; i<=n; i++)
    {
        if(d[i] == oo)
            fout<<-1<<' ';
        else
            fout<<d[i]<<' ';
    }
    return 0;
}