#include <fstream>
#include <queue>
#include <stdlib.h>
#include <vector>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int main()
{
    int n ,m , i, x, y, z;
    int  *minim;
    vector <pair <int,int> > *arce;
    queue <int> pq;
    fin >> n >> m ;
    minim = (int *) calloc(n, sizeof(int));
    arce  =(vector < pair <int,int> > *) calloc(m, sizeof(vector < pair <int,int> >));
    for( i =0; i <m; i++)
    {
        fin >> x >> y >> z;
        if (x!=y)
        arce[x-1].push_back(make_pair(y-1, z));
    }
    pq.push(0);
    while(!pq.empty())
    {
        x = pq.front();
        pq.pop();

        for(i = 0; i < arce[x].size(); i++)
        {
            y = arce[x][i].first;
            if((minim[y] > minim[x] + arce[x][i].second || minim[y] == 0) && y!= 0)
            {
                minim[y] = minim[x] + arce[x][i].second;
                pq.push(y);
            }
        }

    }
    for( i = 1; i < n; i++)
     fout << minim[i] <<" ";
    return 0;
}