// Cu priority Que
#include <iostream>
#include <bits/stdc++.h>
#define MAX 50005
using namespace std;
ifstream in("dijkstra.in");
ofstream out("dijkstra.out");
int N,M;
int tata[MAX], d[MAX];
bool viz[MAX];
int cost_total = 0;
vector<pair<int,int>> Graph[MAX];
auto Compare = [](pair<int,int> &a, pair<int,int> &b)
{
    return get<1>(a)>get<1>(b);
};
priority_queue<pair<int,int>,vector<pair<int,int>>,decltype(Compare) > que(Compare);

void initializare(int nod)
{
    d[nod] = 2e9;
    tata[nod]=0;
}

int main()
{
    in>>N>>M;
    int x,y,z;
    for(int i=1; i<=M; i++)
    {
        in>>x>>y>>z;
        Graph[x].push_back({y,z});
    }
    for(int i=1; i<=N; i++)
        initializare(i);
    d[1] = 0; //Pornesc din 1
    que.push({1,0});

    while(!que.empty())
    {
        int u = que.top().first;
        que.pop();
        viz[u] = true;
        for(auto &vecin:Graph[u])
        {
            int v = vecin.first;
            int w = vecin.second;
            if(!viz[v] && w+d[u]<d[v])
            {
                d[v] = w+d[u];
                tata[v] = u;
                que.push({v,d[v]});
            }
        }
    }
    for(int i=2; i<=N; i++)
         out<<d[i]<<" ";
    return 0;
}