#include <vector>
#include <queue>
#include <stdio.h>
#define N 55000
using namespace std;
int n , m;
int inf = 1 << 30;
int viz[N];
vector < pair <int,int> > cost[N];
queue < pair <int,int> > q;

void read()
{
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);
    scanf("%d %d\n",&n,&m);
    int x, y ,c ;
    for(int i = 1 ; i <= m ; i++)
    {
        scanf("%d %d %d\n",&x,&y,&c);
        cost[x].push_back(make_pair(y,c));
    }
    for(int i = 1 ; i <= n ; i++)
        viz[i] = inf;
}

void dijkstra()
{
    q.push(make_pair(1, 0));
    viz[1] = 0;
    while(!q.empty())
    {
        int prim = q.front().first;
        int l = cost[prim].size();
        q.pop();
        for(int i = 0; i < l; i++)
        {
            if(viz[cost[prim][i].first] > viz[prim] + cost[prim][i].second)
            {
                viz[cost[prim][i].first] = viz[prim] + cost[prim][i].second;
                q.push(cost[prim][i]);
            }
        }
    }
}


void afisare()
{
    for(int i = 1; i <= n; i++)
    {
        if(viz[i] == inf)
            printf("0 ");
        else
            printf("%d ", viz[i]);
    }
}
int main()
{
    read();
    dijkstra();
    afisare();
    return 0;
}