#include <cstdio>
#include <utility>
#include <algorithm>
#include <vector>
#define MAXN 50001
#define INF 1000000000
using namespace std;
vector <pair <int,int> >v[MAXN];
int d[MAXN],heap[MAXN],poz[MAXN],dim;
inline void down(int p)
{
    int x,maxim;
    bool ok=true;
    while((x=p<<1)<=dim && ok)
    {
        ok=false;
        if(x+1<=dim && d[x]>d[x+1])
            maxim=x+1;
        else
            maxim=x;
        if(d[heap[maxim]]<d[heap[p]])
        {
            swap(poz[heap[maxim]],poz[heap[p]]);
            swap(heap[maxim],heap[p]);
            p=maxim;ok=true;
        }
    }
}
inline void up(int p)
{
    int x;
    while((x=p>>1) && d[heap[x]]>d[heap[p]])
    {
        swap(poz[heap[x]],poz[heap[p]]);
        swap(heap[x],heap[p]);
        p=x;
    }
}
int main()
{
    FILE *fin,*fout;
    fin=fopen("dijkstra.in","r");
    fout=fopen("dijkstra.out","w");
    int n,m,x,y,cost;
    fscanf(fin,"%d%d",&n,&m);
    for(int i=0;i<m;i++)
    {
        fscanf(fin,"%d%d%d",&x,&y,&cost);
        v[x].push_back(make_pair(y,cost));
    }
    for(int i=2;i<=n;i++)
        d[i]=INF;
    heap[1]=poz[1]=dim=1;
    while(dim)
    {
        x=heap[1];
        swap(poz[heap[1]],poz[heap[dim]]);
        swap(heap[1],heap[dim]);
        dim--;down(1);
        for(unsigned int i=0;i<v[x].size();i++)
        {
            y=v[x][i].first;cost=v[x][i].second;
            if(d[y]>d[x]+cost)
            {
                d[y]=d[x]+cost;
                if(!poz[y])
                    heap[++dim]=y,poz[y]=dim;
                up(poz[y]);
            }
        }
    }
    for(int i=2;i<=n;i++)
        fprintf(fout,"%d ",d[i]);
    fclose(fin);
    fclose(fout);
    return 0;
}