#include <iostream>
#include <stdio.h>
#include <vector>
#include <set>
#define NMax 50099
#define Infinit 999999999
using namespace std;
vector<int> Graf[NMax];
vector<int> Cost[NMax];
set<pair<int,int> > Heap;
int N,M;
int Distance[NMax];

void Read()
{
    int x,y,z;
    scanf("%d%d",&N,&M);
    for(int i=1;i<=M;i++)
    {
        scanf("%d%d%d",&x,&y,&z);
        Graf[x].push_back(y);
        Cost[x].push_back(z);
    }
}

inline void Initialization()
{
    Heap.insert(make_pair(0,1));
    for(int i=2;i<=NMax;i++)
        Distance[i]=Infinit;
}

void Dijkstra()
{
    Initialization();
    while(Heap.empty()==false)
    {
        int cost=(*Heap.begin()).first;
        int nod=(*Heap.begin()).second;
        Heap.erase(Heap.begin());
        for(int i=0;i<Graf[nod].size();i++)
            if(Distance[Graf[nod][i]]>Distance[nod]+Cost[nod][i])
            {
                Distance[Graf[nod][i]]=Distance[nod]+Cost[nod][i];
                Heap.insert(make_pair(Distance[Graf[nod][i]],Graf[nod][i]));
            }
    }
}

void Write()
{
    for(int i=2;i<=N;i++)
        {
            if(Distance[i]==Infinit)
               printf("0 ");
            else printf("%d ",Distance[i]);
        }
}

int main()
{
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);
    Read();
    Dijkstra();
    Write();
}