#include <bits/stdc++.h>
#define int long long
using namespace std;

const int N = 100010, INF = 1e18;
#define PII pair<int,int>
#define x first
#define y second

int n, m, q;
vector <int> G[N];
int dis[N][2];

void bfs()
{
	memset(dis, 0x3f, sizeof(dis));
	dis[1][0] = 0;
	queue <PII> q;
	q.push({1, 0});
	while(!q.empty())
	{
		int u = q.front().x, fl = q.front().y;
		q.pop();
		for(int i=0; i<G[u].size(); i++)
		{
			int v = G[u][i];
			if(dis[v][fl^1] < INF)
				continue;
			dis[v][fl^1] = dis[u][fl] + 1;
			q.push({v, fl^1});
		}
	}
}

signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	cin >> n >> m >> q;
	for(int i=1,u,v; i<=m; i++)
	{
		cin >> u >> v;
		G[u].push_back(v);
		G[v].push_back(u);
	}
	bfs();
	dis[1][0] = 2;
	while(q --)
	{
		int u, l; cin >> u >> l;
		cout << (dis[u][l%2] <= l ? "Yes\n" : "No\n");
	}
	return 0;
}