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

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

const int NMAX = 50000;
const int INF = 1e9;

int n,m;
vector<pair<int,int>>v[NMAX+1];
int dist[NMAX+1];
void dijkstra(int nod)
{
    for (int i = 1; i <= n; i++)
        dist[i] = INF;
    dist[nod] = 0;
    set<pair<int,int>>s;
    s.insert({0,nod});
    while (!s.empty())
    {
        auto it = s.begin();
        pair<int,int>curr = *it;
        s.erase(it);
        for (pair<int,int> i : v[curr.second])
        {
            int nod_urm = i.first;
            int cost_urm = i.second;
            if (dist[curr.second] + cost_urm < dist[nod_urm])
            {
                auto it1 = s.find({dist[nod_urm], nod_urm});
                if (it1 != s.end())s.erase(it1);//morti matii de pointer
                dist[nod_urm] = dist[curr.second] + cost_urm;
                s.insert({dist[nod_urm], nod_urm});
            }
        }
    }
}

int main()
{
    fin >> n >> m;
    for (int i = 1; i <= m; i++)
    {
        int st,dr,c;
        fin >>st >>dr >>c;
        v[st].push_back({dr,c});
    }
    dijkstra(1);
    for (int i = 2; i <= n; i++)
        fout << dist[i] << ' ';
    return 0;
}