#include <cstdio>
#include <vector>
#include <queue>

#define N 50001
#define infinit 999999999

using namespace std;

struct nod
{
    int v;
    int c;
};
int n,m;
int d[N];
struct cmp
{
    bool operator()(const int &a, const int &b)const
    {
        return d[a]>d[b];
    }
};
vector<nod>h[N];
priority_queue<int,vector<int>,cmp>q;
void citire()
{
    scanf("%d %d",&n,&m);
    for(int i=1;i<=m;i++)
    {
        int v;
        nod a;
        scanf("%d %d %d",&v,&a.v,&a.c);
        h[v].push_back(a);
    }
}
void dijkstra()
{
    d[1]=0;
    for(int i=2;i<=n;i++)
        d[i]=infinit;
    q.push(1);
    while(!q.empty())
    {
        int v=q.top();
        q.pop();
        int nr=h[v].size();
        for(int i=0;i<nr;i++)
        {
            nod p=h[v][i];
            if(d[v]+p.c<d[p.v])
            {
                d[p.v]=d[v]+p.c;
                q.push(p.v);
            }
        }
    }
}
void afisare()
{
    for(int i=2;i<=n;i++)
    {
        if(d[i]==infinit)
            printf("0 ");
        else
            printf("%d ",d[i]);
    }
    printf("\n");
}
int main()
{
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);
    citire();
    dijkstra();
    afisare();
    return 0;
}