#include <iostream>
#include <vector>
#include <fstream>

using namespace std;

ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
vector <int> graph[50005];
vector <int> graphC[50005];
int dist[50005];
int viz[50005];

#define max_size 200005


int main()
{
    int N,M,x,y,c,i,j,k;
    fin>>N>>M;
    for(i=1;i<=M;i++)
    {
        fin>>x>>y>>c;
        graph[x].push_back(y);
        graphC[x].push_back(c);
    }
    for(i=1;i<=N;i++)
     dist[i]=max_size;
    dist[1]=0;
    for(i=0;i<N;i++)
    {
        int min=max_size;
        int index=-1;
        for(j=1;j<=N;j++)
        {
            if((!viz[j])&&(dist[j]<min))
            {
                min=dist[j];
                index=j;
            }
            viz[index]=1;
            int lim=graph[index].size();
            for(k=0;k<lim;k++)
            {
                int vecin=graph[index][k];
                if(dist[vecin]>(dist[index]+graphC[index][k]))
                   dist[vecin]=dist[index]+graphC[index][k];
            }
        }
    }

    for(i=2;i<=N;i++)
      fout<<dist[i]<<" ";
    return 0;
}