#include <bits/stdc++.h>

using namespace std;

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

const int NMAX=200005;
vector <pair <int, int>> g[NMAX];
int n, m, viz[NMAX], d[NMAX];
priority_queue <pair <int, int>> q;

void init(int k)
{
    for(int i=1;i<=n;i++)
        d[i]=-1;
    d[k]=0;
}

void citire()
{
    fin >> n >> m;
    for(int i=1;i<=m;i++)
    {
        int x, y, c;
        fin >> x >> y >> c;
        g[x].push_back({y,c});
        ///g[x].push_back(make_pair(y,c));
    }
}

void dijkstra(int k)
{
    q.push({0,k});
    while(!q.empty())
    {
        auto cap=q.top();
        int nodc=cap.second;
        int cost=-cap.first;
        q.pop();
        if(viz[nodc])
            continue;
        viz[nodc]=1;
        for(auto nbr: g[nodc])
        {
            if(cost+nbr.second<d[nbr.first] || d[nbr.first]==0)
            {
                d[nbr.first]=cost+nbr.second;
                q.push({-d[nbr.first],nbr.first});
            }
        }
    }
}

int main()
{
    citire();
    dijkstra(1);
    for(int i=2;i<=n;i++)
        fout << d[i] << ' ';
    return 0;
}