#include <bits/stdc++.h>

using namespace std;

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

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

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

    return 0;
}