#include <fstream>
#include <vector>
#include <list>
#include <utility>
int main() {
std::ifstream in("in.txt");
int N, M;
in >> N >> M;
std::vector<std::list<std::pair<int,int>>> graph(N+1); // 0-ый элемент всегда будет пустой
for (int i = 0; i < M; ++i) {
int a, b, w;
in >> a >> b >> w;
graph[a].push_back(std::make_pair(b, w));
graph[b].push_back(std::make_pair(a, w));
}
int j = 4;
for (auto i = graph[j].begin(); i != graph[j].end(); ++i) {
i->first;
i->second;
}
}