#include <bits/stdcc++.h>
using namespace std;
typedef pair<int, int> PII;
vector<PII> E[100005];
int D[100005];
void Dijkstra(int k){
    priority_queue<PII,vector<PII>,greater<PII>> Q;
    Q.push({0,k});
    D[k] = 0;
    while(!Q.empty()){
    int len = Q.top().first, nod = Q.top().second;
    Q.pop();
    if(len!=D[nod])
        continue;
    for(auto it : E[nod])
        if(len+it.second<D[it.first]){
         D[it.first] = len + it.second;
         Q.push({D[it.first], it.first});
        }
    }
}

int main(){
    ifstream fin("dijkstra.in");
    ofstream fout("dijkstra.out");
    int n, m;
    fin >> n >> m;
    for(int i = 1; i<=m; i++){
        int st, dr, len;
        fin >> st >> dr >> len;
        E[st].push_back({dr,len});
    }
    for(int i = 2; i<=n; i++)
        D[i] = INT_MAX;
    Dijkstra(1);
    for(int i = 2; i<=n; i++)
        if(D[i] == INT_MAX)
            cout << 0 <<" ";
        else
            cout << D[i] <<" " ;
return 0;
}