#include <bits/stdc++.h>

using namespace std;

ifstream f("dijkstra.in");
ofstream g("dijkstra.out");

int n, m;
int a, b, cost;
vector < pair < int, int > > v[50005];
int dist[50005];
int oo = 2000000007;
set < pair < int , int > > st;
int nod, distn;

int main()
{
    f >> n >> m;
    for(int i = 1; i <= m; i++){
        f >> a >> b >> cost;
        v[a].push_back({b, cost});
    }

    for(int i = 1; i <= n; i++){
        dist[i] = oo;
    }

    dist[1] = 0;
    st.insert({0,1});
    while(st.empty() == 0){
        nod = st.begin()->second;
        st.erase(st.begin());
        for(int k = 0; k < v[nod].size(); k++){
            int ntv = v[nod][k].first;
            int ctv = v[nod][k].second;
            if(dist[ntv] > dist[nod] + ctv){
                st.erase({dist[ntv], ntv});
                dist[ntv] = dist[nod] + ctv;
                st.insert({dist[ntv], ntv});
            }
        }
    }

    for(int i = 2; i <= n; i++){
        if(dist[i] == oo){
            g << 0 << " ";
        }else{
            g << dist[i] << " ";
        }
    }

    return 0;
}