#include <stdio.h>
#include <utility>
#include <vector>
#include <cstring>
#include <queue>
#define NMAX 100055
#define INF 10000000
using namespace std;

vector < vector <pair<int,int>  > > la;
int n,m;
long long dist[NMAX];


void dij()
{
    for(int i=1;i<=n;++i)dist[i]=INF;
    dist[1]=0;
    priority_queue < pair<int,int> , vector<pair<int,int> > , greater<pair<int,int> > > pq;
    pq.push(make_pair(0,1));
    while(!pq.empty())
    {
        int v = pq.top().second;
        pq.pop();
        for(auto i : la[v])
        {
            int vecin = i.first;
            int dvecin = i.second;
            if(dist[vecin] > dist[v] + dvecin)
            {
                dist[vecin] = dist[v] + dvecin;
                pq.push( make_pair(dist[vecin] , vecin) );
            }
        }
    }
}

void citire()
{
    FILE *fin = fopen("dijkstra.in","r");
    FILE *fout = fopen("dijkstra.out","w");
    fscanf(fin,"%d %d",&n,&m);
    la.resize(n+1);
    int x,y,c;
    for(int i=1;i<=m;++i)
    {
        fscanf(fin,"%d %d %d",&x,&y,&c);
        la[x].push_back(make_pair(y,c));
    }
    dij();
    for(int i=2;i<=n;++i)
        fprintf(fout,"%d ",dist[i]);
}


int main()
{
    citire();


}