#include <bits/stdc++.h>
using namespace std;
vector<vector<pair<int, int>> > conns;
vector<int> ind;
void dijkstra(int maxcost){
}
int main(){
int nodes, edges, targets;
cin >> nodes >> edges >> targets;
conns.resize(nodes);
ind.resize(nodes);
ios_base::sync_with_stdio(0);
vector<pair<int, int>> edgeSort;
for (int i = 0; i < edges; i++){
int a, b, c;
cin >> a >> b>> c;
a--; b--; c *= -1;
conns[a].push_back({c,b});
conns[b].push_back({c, a});
}
for (int i = 0 ; i < nodes; i++){
sort(conns[i].begin(), conns[i].end());
}
}
