#include <bits/stdc++.h>
#define INF 0x3F3F3F3F
#define N 50000
using namespace std;

array <int, N+1> dist;
vector <pair <int, int>> G[N+1];
class heap {
private:
    int nod, dist;
public:
    heap (int i, int j) {tie(nod, dist)=tie(i, j);}
    bool operator < (const heap &x) const {return this->dist <= x.dist;}
};

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

    int n, m;
    fin >> n >> m;

    int i, j, c;
    for (; m; m--) {
        fin >> i >> j >> c;
        G[i].push_back(make_pair(j, c));
    }

    dist.fill(INF);
    return 0;
}