#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
#include <bits/stdc++.h>
using namespace std;

ifstream in("dijkstra.in");
ofstream out("dijkstra.out");
const int NMAX = 50003;
const int MMAX = 250003;
const int INF = 1 << 30;
bitset <NMAX> used;
int sol[NMAX];
int n,m;
vector <pair<int,int> > Graf[NMAX];
priority_queue <pair<int,int> > my_queue;

void citire()
{
    in>>n>>m;
    for(int i=1; i<=m; i++)
    {
        int x1,y1,z1;
        in>>x1>>y1>>z1;
        Graf[x1].push_back({y1,z1});
    }
    for(int i=2; i<=n; i++)
    {
        sol[i]=INF;
    }

}

void dijkstra()
{
    my_queue.push({0,1});
    while(my_queue.empty()==0)
    {
        int node=my_queue.top().second;
        my_queue.pop();

        for(register int i=0; i<Graf[node].size(); i++)
        {
            int j=Graf[node][i].first;
            int cost = Graf[node][i].second;
            if(sol[j]>cost+sol[node])
            {
                sol[j]=cost+sol[node];
                my_queue.push({-sol[j],j});
            }
        }
    }
}

int main()
{
    citire();
    dijkstra();
    for(int i=2; i<=n; i++)
    {
        if(sol[i]==INF)
            out<<0<<" ";
        else
            out<<sol[i]<<" ";
    }
}