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

using namespace std;

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

int n, m;
vector<pair<int, int>> graf[50005];
queue<int> q;
bool viz[50005];
int dist[50005];

void bfs(int nod)
{
    int cn;
    viz[nod] = true;
    q.push(nod);
    while (!q.empty())
    {
        cn = q.front();
        q.pop();
        for (int i = 0; i < graf[cn].size(); i++)
        {
            if (viz[graf[cn][i].first] == false)
            {
                q.push(graf[cn][i].first);
            }
            if (dist[graf[cn][i].first] == 0)
            {
                dist[graf[cn][i].first] = dist[cn] + graf[cn][i].second;
            }
            else
            {
                dist[graf[cn][i].first] = min(dist[cn] + graf[cn][i].second, dist[graf[cn][i].first]);
            }
        }
    }
}

int main()
{
    fin >> n >> m;
    int x, y, z;
    for (int i = 0; i < n; i++)
    {
        fin >> x >> y >> z;
        graf[x].push_back({ y, z });
    }
    bfs(1);
    for (int i = 2; i <= n; i++)
    {
        fout << dist[i] << ' ';
    }
    return 0;
}