#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
const int Maxn=50001;
const int INF=1000000000;
int heap[Maxn],poz[Maxn],d[Maxn],k;
vector <pair <int,int> >v[Maxn];
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;
    }
}
inline void down(int p)
{
    int x,minim;
    bool ok=true;
    while((x=p<<1)<=k && ok)
    {
        ok=false;
        if(x<k && d[heap[x+1]]<d[heap[x]])
            minim=x+1;
        else
            minim=x;
        if(d[heap[minim]]<d[heap[p]])
        {
            swap(poz[heap[minim]],poz[heap[p]]);
            swap(heap[minim],heap[p]);
            p=minim;ok=true;
        }
    }
}
inline void pop()
{
    swap(poz[heap[1]],poz[heap[k]]);
    swap(heap[1],heap[k]);
    k--;down(1);
}
inline void push(int x)
{
    heap[++k]=x;poz[x]=k;
    up(k);
}
int main()
{
    FILE *fin,*fout;
    fin=fopen("dijkstra.in","r");
    fout=fopen("dijkstra.out","w");
    int n,m,x,y,c;
    fscanf(fin,"%d%d",&n,&m);
    for(int i=0;i<m;i++)
    {
        fscanf(fin,"%d%d%d",&x,&y,&c);
        v[x].push_back(make_pair(y,c));
    }
    for(int i=2;i<=n;i++)
        d[i]=INF;
    push(1);
    while(k)
    {
        x=heap[1];pop();
        for(size_t i=0;i<v[x].size();i++)
        {
            y=v[x][i].first;c=v[x][i].second;
            if(d[y]>d[x]+c)
            {
                d[y]=d[x]+c;
                if(!poz[y])
                    push(y);
                else
                    up(poz[y]);
            }
        }
    }
    for(int i=2;i<=n;i++)
        fprintf(fout,"%d ",d[i]);
    fclose(fin);
    fclose(fout);
    return 0;
}