#include<bits/stdc++.h>
using namespace std;
int fa[5005];
int n, m, p;
int x, y;
int find(int x)
{
	if(fa[x] == 0)
		return x;
	return find(fa[x]);
}
void add(int x, int y)
{
	fa[x] = y;
	if(find(x) == find(y))
		return ;
}
int main()
{
	scanf("%d%d%d", &n, &m, &p);
	for(int i = 1;i <= 2 * n;i++)
		fa[i] = i;
	for(int i = 1;i <= n;i++)
	{
		scanf("%d%d", &x, &y);
		add(x, y);
	}
	while(p--)
	{
		scanf("%d%d", &x, &y);
		if(find(x) == find(y))
			printf("YES\n");
		else
			printf("NO\n");
	}
	return 0;
}

求大佬检查问题QAQ