#include <bits/stdc++.h>
using namespace std;

ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

int n,m,i,dist[500005],a,b,val,nod,vecin;
priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>>Q;
vector <pair<int,int>> v[50005];

int main()
{
//lungime 0 nu infinit
fin>>n>>m;
for(i=1;i<=m;i++){
    fin>>a>>b>>val;
    v[a].push_back({b,val});
}
dist[1] = 0;
//invers coada
Q.push({0,1});
for(i=2;i<=n;i++){
    dist[i] = 200000000;
}
while(!Q.empty()){
    nod = Q.top().second;
    val = Q.top().first;
    Q.pop();
    for(i=0;i<v[nod].size();i++){
        vecin = v[nod][i].first;
        if(dist[vecin] > val + v[nod][i].second){
            dist[vecin] = val + v[nod][i].second;
            Q.push({dist[vecin],vecin});
        }

    }
}
for(i=2;i<=n;i++){
    if(dist[i] == 200000000)
    dist[i] = 0;

    fout << dist[i] << " ";
}
    return 0;
}