#include<bits/stdc++.h>
using namespace std;
const long long mod1=998244353;
const long long mod2=1000000007;
const long long inf=0x3f3f3f3f3f3f3f3f;
struct node{
	long long sumodd,sumeven;
	vector<long long>e;
}a[100001];
long long n,m,l;

long long read();
void write(long long x);
void init();
void domemset();

bool flagodd[200001],flageven[200001];
pair<long long,long long>q[400001];
long long head=1,tail;
void bfs()
{
	pair<long long,long long>t;
	t.first=1;t.second=0;
	q[++tail]=t;
	while(head<=tail)
	{
		pair<long long,long long>u;
		u=q[head];
		head++;
		if(u.second%2==0&&flagodd[u.first]==1||u.second%2==1&&flageven[u.first]==1)
			continue;
//		cout<<u.first<<" "<<u.second<<endl;
		if(u.second%2==0)
		{
			flagodd[u.first]=1;
			a[u.first].sumodd=u.second;
		}
		else
		{
			flageven[u.first]=1;
			a[u.first].sumeven=u.second;
		}
		pair<long long,long long>t;
		t.second=u.second+1;
		for(int i=0;i<a[u.first].e.size();i++)
		{
			t.first=a[u.first].e[i];
			q[++tail]=t;
		}
	}
	return ;
}
void fun()
{
//	domemset();
	n=read();m=read();l=read();
	for(int i=1;i<=m;i++)
	{
		long long x=read(),y=read();
		a[x].e.push_back(y);
		a[y].e.push_back(x);
	}
	bfs();
	for(int i=1;i<=l;i++)
	{
		long long x=read(),y=read();
		if(y%2==0&&a[x].sumodd<=y&&flagodd[x]==1||y%2==1&&a[x].sumeven<=y&&flageven[x]==1)
			cout<<"Yes\n";
		else
			cout<<"No\n";
	}
	return ;
}
int main()
{
	srand(time(NULL));
//	init();
//	while(1)
//	t=read();
//	for(int i=1;i<=t;i++)
		fun();
	return 0;
}


void init()
{

	return ;
}
void domemset()
{

	return ;
}



long long read()
{
	long long x=0,f=1;
	char ch=getchar();
	while(ch<'0'||ch>'9')
	{
		if(ch=='-')
			f=-1;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9')
	{
		x=(x<<3)+(x<<1)+(ch^'0');
		ch=getchar();
	}
	return x*f;
}
void write(long long x)
{
	if(x<0)
		putchar('-'),x=-x;
	if(x>=10)
		write(x/10);
	putchar((x%10)^'0');
	return ;
}