#include "testlib.h"
#include <cassert>
#include <set>
#include <queue>

int main(int argc, char* argv[]) {
	registerValidation(argc, argv);

	using i64 = long long;

	// 入力
	const i64 N = inf.readInt(2, 50'000); inf.readSpace();
	const i64 M = inf.readInt(N - 1, std::min<i64>(N * (N - 1) / 2, 50'000)); inf.readEoln();

	std::vector<int> U(M), V(M);
	for(int i = 0; i < M; i++) {
		U[i] = inf.readInt(1, N); inf.readSpace();
		V[i] = inf.readInt(1, N); inf.readEoln();
	}

	std::vector<int> A(N), B(N), C(N);
	for(int i = 0; i < N; i++) {
		A[i] = inf.readInt(1, 1'000'000'000); inf.readSpace();
		B[i] = inf.readInt(1, 1'000'000'000); inf.readSpace();
		C[i] = inf.readInt(1, 1'000'000'000); inf.readEoln();
	}
	inf.readEof();

	{ // 自己ループ・多重辺のチェック
		std::set<std::pair<int, int>> edges;

		for(int i = 0; i < M; i++) {
			if(!(U[i] < V[i])) std::swap(U[i], V[i]);

			assert(U[i] != V[i]); // 自己ループ
			assert(!edges.count({U[i], V[i]})); // 多重辺

			edges.insert({U[i], V[i]});
		}
	}

	{ // 連結性のチェック
		std::vector<std::vector<int>> g(N);
		for(int i = 0; i < M; i++) {
			g[U[i] - 1].push_back(V[i] - 1);
			g[V[i] - 1].push_back(U[i] - 1);
		}

		std::vector<bool> used(N);
		std::queue<int> qu({0});
		while(!qu.empty()) {
			int v = qu.front(); qu.pop();

			if(used[v]) continue;
			used[v] = true;

			for(int to: g[v]) qu.push(to);
		}

		assert(std::all_of(begin(used), end(used), [](bool x) { return x; }));
	}

	return 0;
}