#include <fstream>
#include <climits>
#include <set>
#include <vector>
//#include <iostream>
using namespace std;

ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");

const int NMAX = 50003;
vector <pair <int, int> > v[NMAX];
int d[NMAX];

set <pair <int, int> > s;
int main()
{
    int n, m, i;
    cin >> n >> m;
    while (m--)
    {
        int a, b, c;
        cin >> a >> b >> c;
        v[a].push_back({b, c});
    }
    for (i = 1; i <= n; i++)
        d[i] = INT_MAX;
    s.insert({0, 1});
    d[1] = 0;
    int cnt = 0;
    while (!s.empty())
    {
        int f = s.begin()->second;
        s.erase(s.begin());
        for (int i = 0; i < v[f].size(); i++)
            if (d[f] + v[f][i].second < d[v[f][i].first])
            {
                if (d[v[f][i].first] != INT_MAX)
                    s.erase(s.find({d[v[f][i].first], v[f][i].first}));
                d[v[f][i].first] = d[f] + v[f][i].second;
                s.insert({d[v[f][i].first], v[f][i].first});
            }
    }
    for (i = 2; i <= n; i++)
    {
        if (d[i] == INT_MAX)
            d[i] = 0;
        cout << d[i] << " ";
    }
}