#include <iostream>
#include <cstdio>
#include <queue>
#include <vector>
#define inf 0x7fffffff

using namespace std;

int m,n,d[50050];

struct vecin
{
    int x,c;
};

struct cmp
{
    bool operator()(int a, int b)
    {
        return d[a] > d[b];
    }
};


vector <vecin> a[50050];
priority_queue <int, vector<int>, cmp> q;

void citire()
{
    freopen("dijkstra.in","r",stdin);
    scanf("%d %d",&n,&m);
    for(int i=0;i<m;i++)
    {
        int k;
        vecin aux;
        scanf("%d %d %d",&k,&aux.x,&aux.c);
        a[k].push_back(aux);
    }

    for(int i=2;i<50050;i++)
        d[i]=inf;


}

void Dijkstra()
{
    q.push(1);
    while(!q.empty())
    {
        int k = q.top();
        q.pop();
        for(int i=0;i<a[k].size();i++)
        {
            if(d[k]+a[k][i].c<d[a[k][i].x])
            {
                q.push(a[k][i].x);
                d[a[k][i].x]=d[k]+a[k][i].c;
            }
        }
    }
}

int main()
{
    citire();
    Dijkstra();
    freopen("dijkstra.out","w",stdout);
    for(int i=2;i<=n;i++)
        if(d[i]>=inf)
            printf("0 ");
        else
            printf("%d ",d[i]);

    return 0;
}