#include <cstdio>
#include <queue>
#include <algorithm>
#include <vector>
#define INF 99999999

using namespace std;

int n,m;
int d[50005];
bool sel[50005];
queue <int>q;
vector<pair<int,int>>g[50005];
void dijkstra(int p){
    for(int i=1;i<=n;i++)
        sel[i]=false, d[i]=INF;
    d[p]=0;
    q.push(p);
    sel[p]=true;
    while(!q.empty())
    {
        int k=q.front();
        q.pop();
        sel[k]=true;
        for(int j=0;j<g[k].size();j++)
        {
            int y=g[k][j].first;
            int cost=g[k][j].second;
            if(!sel[y] && d[y]>d[k]+cost){
                d[y]=d[k]+cost;
                q.push(y);
                sel[y]=true;
            }
        }
    }
}
int main(){
        freopen("dijkstra.in","r",stdin);
        freopen("dijkstra.out","w",stdout);
        scanf("%d %d",&n,&m);
        int x,y,c;
        for(int i=1;i<=n;i++)
        {
            scanf("%d %d %d",&x,&y,&c);
            g[x].push_back(make_pair(y,c));
        }
        int p=1;
        dijkstra(p);
        for(int i=1;i<=n;i++)
        {
            if(d[i]==INF && i!=p)printf("0 ");
            else if(i!=p)printf("%d ",d[i]);
        }



    return 0;
}