#include <bits/stdc++.h>
using namespace std;
struct Step {
	int x,step;
};
int n,m,q,u,v,a,L,len,flag;
vector<int> e[100005];
queue<Step> qu;
int main() {
	cin >> n >> m >> q;
	for (int i = 1; i <= m; ++i) {
		cin >> u >> v;
		e[u].push_back(v);
		e[v].push_back(u);
	}
	while (q--)	{
		cin >> a >> L;
		flag = 0;
		Step _new;
		_new.x = a,_new.step = L;
		qu.push(_new);
		while (!qu.empty()) {
			Step p = qu.front();
			qu.pop();
			len = e[p.x].size();
			for (int i = 0; i < len; ++i) {
				Step _new;
				_new.x = e[p.x][i],_new.step = L - 1;
				qu.push(_new);
				if (_new.x = 1 && _new.step == 0) {
					flag = 1;
					break;
				}
			}
			if (flag) break;
		}
		flag?cout << "Yes\n":cout << "No\n";
	}
	return 0;
}