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

using namespace std;

#define INF 100100
#define NMAX 50100

ifstream f("dijkstra.in");
ofstream g("dijkstra.out");

int viz[NMAX];
int n,m;
int Dist[NMAX];
vector <pair <int,int> > graf[NMAX];

struct compara
{
    bool operator()(int x, int y)
    {
        return Dist[x] > Dist[y];
    }
};

priority_queue<int, vector<int>, compara> Coada;

void citireGraf(int m)
{
    int i,x,y,c;
    for(i = 1; i <= m; i++)
    {
        f>>x>>y>>c;
        graf[x].push_back(make_pair(y,c));
    }
}

void ini(int x)
{
    int i;
    for(i = 1; i <= n; i++)
        Dist[i] = INF;
    Dist[x]=0;

}

void Dijkstra(int nodStart)
{
    ini(nodStart);
    Coada.push(nodStart);
    viz[nodStart] = 1;

     while(Coada.empty()==false)
    {
        int nodCurent = Coada.top();
        Coada.pop();
        viz[nodCurent] = 0;

        int lim = graf[nodCurent].size();

            for(int i = 0; i < lim; i++)
            {
                int vecin = graf[nodCurent][i].first;
                int cost = graf[nodCurent][i].second;

                if(Dist[nodCurent] + cost < Dist[vecin])
                {
                    Dist[vecin] = Dist[nodCurent] +cost;
                    if(viz[vecin] == 0)
                    {
                        Coada.push(vecin);
                        viz[vecin] = 1;
                    }
                }
            }
    }

}

int main()
{
    int lim,i;
    f>>n>>m;
    citireGraf(m);

    Dijkstra(1);

    for(i=2;i<=n;i++)
        {
            if(Dist[i] == INF)
                g<<0<<" ";
            else
            g<<Dist[i]<<" ";
        }

    return 0;
}