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