#include <bits/stdc++.h>

using namespace std;

const int nmax=50005;

vector <pair <int, int> > graph_orientat[nmax];
int cost[nmax];
int cost_curent;
bool visited[nmax];

void dfs(int start_node)
{
    visited[start_node]=true;
    for(int i=0;i<graph_orientat[start_node].size();i++)
    {
        if(visited[graph_orientat[start_node][i].first]==false)
        {
            visited[graph_orientat[start_node][i].first]=true;
            cost_curent+=graph_orientat[start_node][i].second;
            cost[graph_orientat[start_node][i].first]=min(cost[graph_orientat[start_node][i].first], cost_curent);
            dfs(graph_orientat[start_node][i].first);
            visited[graph_orientat[start_node][i].first]=false;
            cost_curent-=graph_orientat[start_node][i].second;
        }
    }
}

int main()
{
    freopen("dijkstra.in", "r", stdin);
    freopen("dijkstra.out", "w", stdout);
    int n, m;

    scanf("%d%d", &n, &m);
    for(int i=1;i<=n;i++)
    {
        int a, b, c;
        scanf("%d%d%d", &a, &b, &c);
        graph_orientat[a].push_back(make_pair(b, c));
    }
    for(int i=1;i<=n;i++)
        cost[i]=1000000000;
    dfs(1);
    for(int i=2;i<=n;i++)
    {
        if(cost[i]==1000000000)
            printf("0 ");
        else
            printf("%d ", cost[i]);
    }
    printf("\n");

    return 0;
}