#include <fstream>
#include <queue>
#include <vector>
using namespace std;
ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");
#define MAX 999999999
priority_queue <pair<int,int>> q;
vector <pair<int,int>> v[105];
int cost[105];

int main()
{
    int n, m, p;
    int x, y, c;
    cin >> n >> m;
    p = 1;
    while (cin >> x >> y >> c)
        v[x].push_back({ y,c });

    for (int i = 1; i <= n; i++)
        cost[i] = MAX;
    cost[p] = 1;

    q.push({ -1,p });
    while (!q.empty())
    {
        auto node = q.top();
        q.pop();
        for (auto vecin : v[node.second])
        {
            int costcur = -node.first + vecin.second;

            if (costcur < cost[vecin.first])
            {
                q.push({ -costcur,vecin.first });
                cost[vecin.first] = costcur;
            }
        }
    }
    for (int i = 1; i <= n; i++)
        if (cost[i] == MAX)
            cout << -1;
        else
            cout << cost[i] << ' ';
    return 0;
}