排座位（PTA）

#include <iostream>
#include <set>
using namespace std;
set<int> ene[105];
int arr[105];
int find(int x) {
	if (arr[x] == x) return x;
	return arr[x] = find(arr[x]);
}
int main() {
	int n, m, k;
	cin >> n >> m >> k;
	for (int i = 1; i <= n; i++) arr[i] = i;
	for (int i = 0, a, b, c; i < m; i++) {
		cin >> a >> b >> c;
		if (c == 1) {
			a = find(a);
			b = find(b);
			arr[a] = b;
		}
		else {
			ene[a].insert(b);
			ene[b].insert(a);
		}
	}
	for (int i = 0, a, b; i < k; i++) {
		cin >> a >> b;
		if (ene[a].count(b)) {
			if (find(a) == find(b)) cout << "OK but..." << endl;
			else {
				cout << "No way" << endl;
			}
		}
		else {
			if (find(a) == find(b)) cout << "No problem" << endl;
			else {
				cout << "OK" << endl;
			}
		}
	}
	return 0;
}