#include <fstream>
#include <vector>
#include <queue>

using namespace std;

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

int n, m;
vector <pair <int, int>> vecin[50005];
priority_queue<pair <int, int>> dist_min;
int dist_noduri[50005];

void dijkstra(int nod, int nr_noduri)
{
    dist_noduri[nod] = 0;
    dist_min.push({-dist_noduri[nod], nod});
    while(!dist_min.empty())
    {
        int nod_curent = dist_min.top().second;
        int dist = -dist_min.top().first;
        dist_min.pop();
        if (dist != dist_noduri[nod_curent]) continue;
        for (int i = 0; i < vecin[nod_curent].size(); ++i)
        {
            if (dist_noduri[vecin[nod_curent][i].first] <= dist_noduri[nod_curent] + vecin[nod_curent][i].second)
                continue;
            dist_noduri[vecin[nod_curent][i].first] = dist_noduri[nod_curent] + vecin[nod_curent][i].second;
            dist_min.push({-dist_noduri[vecin[nod_curent][i].first], vecin[nod_curent][i].first});
        }
    }

    for(int i=2; i<=nr_noduri; ++i)
    {
        if(dist_noduri[i] == 100000000)
            dist_noduri[i] = 0;
        cout << dist_noduri[i] << " ";
    }
}

int main()
{
    cin >> n >> m;
    for(int i=1; i<=n; ++i)
    {
        dist_noduri[i] = 100000000;
    }

    for(int i=1; i<=m; ++i)
    {
        int x, y, distxy;
        cin >> x >> y >> distxy;
        vecin[x].push_back({y, distxy});
    }

    dijkstra(1, n);
    return 0;
}