#include <fstream>
#include <vector>
#define NMAX 500002
#define INF (1LL<<40)
using namespace std;
ifstream  fin("dijkstra.in");
ofstream fout("dijkstra.out");
int H,n,m,p,heap[NMAX];
vector<long long> cost(NMAX,INF);
vector<pair<int,int>>graph[NMAX];

void citire()
{
    int a,b,c;
    fin>>n>>m;

    for(int i=1; i<=m; i++)
    {
        fin>>a>>b>>c;
        graph[a].push_back({b,c});
    }
}

void urcare(int poz)
{
    while(poz/2>=1 && cost[heap[poz]]<cost[heap[poz/2]])
    {
        swap(heap[poz],heap[poz/2]);
        poz=poz/2;
    }
}

void coborare(int poz)
{
    while(2*poz<=H)
    {
        int r=2*poz;
        if(r+1<=H && cost[heap[r+1]]<cost[heap[r]])
        {
            r++;
        }

        if(cost[heap[poz]]>cost[heap[r]])
        {
            swap(heap[poz],heap[r]);
            poz=r;
        }
        else
        {
            break;
        }
    }
}

void adaugare_heap(int nod)
{
    heap[++H]=nod;
    urcare(H);
}

void scoatere_min()
{
    heap[1]=heap[H];
    H--;
    coborare(1);
}

int main()
{
    citire();

    cost[1]=0;
    H=0;
    adaugare_heap(1);

    while(H>0)
    {
        int nod=heap[1];
        scoatere_min();

        if(cost[nod]==INF)
        {
            continue;
        }

        for(int i=0; i<graph[nod].size(); i++)
        {
            int next_nod=graph[nod][i].first;
            if(cost[nod]+graph[nod][i].second<cost[next_nod])
            {
                cost[next_nod]=cost[nod]+graph[nod][i].second;
                adaugare_heap(next_nod);
            }
        }
    }

    for(int i=2; i<=n; i++)
    {
        if(cost[i]==INF)
        {
            cost[i]=0;
        }
        fout<< cost[i] << " ";
    }
    fout<< "\n";

    return 0;
}