#include <bits/stdc++.h>
#define pb push_back

using namespace std;
const string file_name = "dijkstra";
const int NMAX = 1000001;

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

            //cost nod
priority_queue<pair<int,int>> pq;
vector<pair<int,int>> Graf[10];
bool viz[NMAX];
int dis[NMAX];
int n,m,x,y,c;


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

void init()
{
    for(int i=1;i<=n;i++)
    {
        dis[i] = NMAX;
    }
    dis[1] = 0;
}

void relax(int x, int y, int c)
{
    if(dis[x]>dis[y]+c)
        dis[x] = dis[y]+c;
}


void dijkstra_bfs()
{
    init();
    pq.push({0,1});
    while(!pq.empty())
    {
        auto top = pq.top();
        int nodc = top.second;
        viz[nodc] = 1;
        pq.pop();
        for(auto nbr: Graf[nodc])
        {
            int cost = nbr.second;
            int nb = nbr.first;
            if(viz[nb])
                continue;
            if(!viz[nb] && dis[nb]>=dis[nodc]+cost)
            {
                relax(nb,nodc,cost);
                pq.push({-dis[nb],nb});
            }
        }
    }
}


int main()
{
    citire();
    dijkstra_bfs();
    for(int i=2;i<=n;i++)
    {
        fout<<dis[i]<<" ";
    }
}