#include<cstdio>
#include<vector>
#include<queue>
#define NMax 50005
#define inf 1e9
using namespace std;

struct muchie
{ int nd,cost; };
muchie y;
int n,m,d[NMax],inqueue[NMax];

vector <muchie> v[NMax];
queue <int> q;

void citire ()
{
    int x,i;
    scanf("%d%d",&n,&m);
    for (i=1; i<=m; i++)
    {
        scanf("%d%d%d",&x,&y.nd,&y.cost);
        v[x].push_back(y);
    }
}

void init ()
{
    int i;
    for (i=2; i<=n; i++)
        d[i]=inf;
    d[1]=0;
}

void bellman_ford ()
{
    init();
    q.push(1);
    inqueue[1]=1;

    while (!q.empty())
    {
        int nod=q.front();
        q.pop();
        inqueue[nod]=0;
        for (int i=0; i<v[nod].size(); i++)
            if (d[v[nod][i].nd]>d[nod]+v[nod][i].cost)
            {
                d[v[nod][i].nd]=d[nod]+v[nod][i].cost;
                if (!inqueue[v[nod][i].nd])
                {
                    q.push(v[nod][i].nd);
                    inqueue[v[nod][i].nd]=1;
                }
            }
    }
}

int main ()
{
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);
    citire();
    bellman_ford();
    for (int i=2; i<=n; i++)
        if (d[i]==inf)
            printf("0 ");
        else printf("%d ",d[i]);
    return 0;
}