#include <bits/stdc++.h>

using namespace std;

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

int i,j,n,p,dist[50005],a,b,val,viz[50005],nod,vecin,m;
priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> pq;
vector <pair<int,int>> v[50005];

int main()
{
fin>>n>>m;

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

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