#include <bits/stdc++.h>

using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
vector <pair<int,int>> lista[100005];
void citire(int &n,int &m){
    int x,y,cost;
    fin>>n>>m;
    for(int i=1;i<=m;i++){
        fin>>x>>y>>cost;
        lista[x].push_back({y,cost});

    }
}
int dp[100005];
void bellman_ford(int p){
    int n,m;
    citire(n,m);
    queue <int> q;
    for(int i=1;i<=n;i++)
        dp[i]=-1;
    dp[p]=0;
    q.push(p);
    while(!q.empty()){
        int x=q.front();
        q.pop();
        for(auto vecin:lista[x]){
            int cost;
            cost=dp[x]+vecin.second;
            if(dp[vecin.first]==-1 || dp[vecin.first]>cost){
                dp[vecin.first]=cost;
                q.push(vecin.first);
            }
        }
    }
    for(int i=2;i<=n;i++){
        if(dp[i]!=-1){
        fout<<dp[i]<<" ";
        }
        else
            fout<<0<<" ";
    }
}
int main()
{
    bellman_ford(1);
    return 0;
}