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

#define INF 2147483600

using namespace std;

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

priority_queue< pair<int, int>, vector< pair<int, int> >, greater< pair<int, int>> > Q;

vector <pair <int, int>> edges[50001];
int dist[50001];
bool vis[50001];

int main()
{
    int n, m, i, a, b, c;
    fin >> n >> m;
    for(i = 1; i <= m; i++)
    {
        fin >> a >> b >> c;
        edges[a].push_back(make_pair(b, c));
    }
    for(i = 1; i <= n; i++)
    {
        dist[i] = INF;
        vis[i] = false;
    }

    int start = 1;
    dist[start] = 0;
    Q.push(make_pair(0, start));
    while(!Q.empty())
    {
        int nod_min = Q.top().second;
        Q.pop();

        if(vis[nod_min])
            continue;

        vis[nod_min] = 1;
        for(i = 0; i < edges[nod_min].size(); i++)
        {
            int cost = edges[nod_min][i].second;
            int nod = edges[nod_min][i].first;

            if(vis[nod] == false && dist[nod] > dist[nod_min] + cost)
            {
                dist[nod] = dist[nod_min] + cost;
                Q.push(make_pair(dist[nod], nod));
            }
        }
    }

    for(i = 2; i <= n; i++)
    {
        if(dist[i] == INF)
            fout << "0 ";
        else
            fout << dist[i] << " ";
    }
    return 0;
}