#include <bits/stdc++.h>
using namespace std;

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

const int SIZE = 50002;
const int INF = 1e9;

struct compare
{
    bool operator()(pair<int,int> l, pair<int, int> r)
    {
        return l.second > r.second;
    }
};

priority_queue<pair<int,int>, vector<pair<int,int>>, compare> qu;
vector<pair<int, int>> gr[SIZE];
vector<int> dist(SIZE, INF);
int n, m, x, y, z;

void dijk(int stnd)
{
    dist[stnd] = 0;
    qu.push(make_pair(stnd, dist[stnd]));
    while (!qu.empty())
    {
        int nod = qu.top().first;
        int distanta = qu.top().second;
        qu.pop();
        if (!(distanta > dist[nod]))
        {
            for (auto i: gr[nod])
            {
                int vec = i.first;
                int cost = i.second;
                if (dist[nod] + cost < dist[vec])
                {
                    dist[vec] = dist[nod] + cost;
                    qu.push(make_pair(vec, dist[vec]));
                }
            }
        }
    }
}


int main()
{
    fin>>n>>m;
    for (int i = 1; i <= m; i++)
    {
        fin>>x>>y>>z;
        gr[x].push_back(make_pair(y, z));
    }
    dijk(1);
    for (int i = 2; i <= n; i++)
    {
        if (dist[i] == INF)
            fout<<"0 ";
        else
            fout<<dist[i]<<" ";
    }
}