#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 x,y,value;
        in>>x>>y>>value;
        Graf[x].push_back({y,value});
    }

    for(int i=2;i<=n;i++)
    {
        sol[i] = INF;
    }

}

void dijkstra()
{
    my_queue.push({0,1});
    while(!my_queue.empty())
    {
        int node = my_queue.top().second;
        my_queue.pop();
        if(used[node]==1)
            continue;
        used[node]=1;
        int nr=Graf[node].size();
        for(int i=0; i<nr; i++)
        {
            int j=Graf[node][i].first;
            int value = Graf[node][i].second;
            if(sol[j]>value+sol[node])
            {
                sol[j]=value+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]<<" ";
        }
    }
}