#include<fstream>
#include<vector>
#include<set>
#define MAX_V 50000
#define oo 0x3f3f3f3f
using namespace std;

vector<pair<int, int>>g[MAX_V + 1];
int dmin[MAX_V + 1], n, m;
set<pair<int, int>> s;

void readGraph() {
    int i, x, y, c;
    ifstream fin("dijkstra.in");
    fin >> n >> m;
    for(i = 1; i <= m; i++) {
        fin >> x >> y >> c;
        g[x].push_back({y, c});
    }
    fin.close();
}

void Dijkstra(int source) {
    int node;
    for(int i = 1; i <= n; i++)
        dmin[i] = oo;
    dmin[source] = 0;
    s.insert({0, source});
    while(!s.empty()) {
        node = s.begin()->second;
        s.erase(s.begin());
        for(auto i : g[node]) {
            if(dmin[i.first] > dmin[node] + i.second) {
                if(dmin[i.first] != oo)
                    s.erase(s.find({dmin[i.first], i.first}));

                dmin[i.first] = dmin[node] + i.second;
                s.insert({dmin[i.first], i.first});
            }
        }
    }
}

void printDistances() {
    ofstream fout("dijkstra.out");
    for(int i = 2; i <= n; i++) {
        if(dmin[i] == oo)
            fout << "0 ";
        else fout << dmin[i] << " ";
    }
    fout << "\n";
    fout.close();
}

int main() {
    readGraph();
    Dijkstra(1);
    printDistances();
    return 0;
}