#include<algorithm>
using namespace std;
#include<vector>
#include<queue>

#define DIM 50005

vector <pair <int,int> > lst[DIM];
queue <int> c;

int n,a[DIM],m;
void read ()
{
    int i,x,y,c;
    scanf("%d%d",&n,&m);
    for(i=2;i<=n;++i)
        a[i]=1<<30;
    for(i=1;i<=m;++i)
    {
        scanf("%d%d%d",&x,&y,&c);
        lst[x].push_back (make_pair (y,c));
    }
}
void solve ()
{
    int aux,i;
    c.push (1);
    while(!c.empty ())
    {
        aux=c.front ();
        for(i=0;i<(int)lst[aux].size ();++i)
            if(a[aux]+lst[aux][i].second<a[lst[aux][i].first])
            {
                a[lst[aux][i].first]=a[aux]+lst[aux][i].second;
                c.push (lst[aux][i].first);
            }
        c.pop ();
    }
}
void show ()
{
    int i;
    for(i=2;i<=n;++i)
        printf("%d ",a[i]);
}
int main ()
{
    freopen ("dijkstra.in","r",stdin);
    freopen ("dijkstra.out","w",stdout);
    read ();
    solve ();
    show ();
    return 0;
}