#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
struct Lowlink {
	int sz;
	vector<vector<int>>edge;
	vector<int>ord, low;
	vector<bool>used;
	vector<int>aps;//これと取り除くと連結成分が非連結になる頂点
	vector<P>bridges;//これと取り除くと連結成分が非連結になる辺
	Lowlink(int  _sz) :sz(_sz) {
		ord.resize(sz);
		low.resize(sz);
		used.resize(sz);
		edge.resize(sz);
	}
	void ReadGraph(int m) {
		rep(i, m) {
			int a, b; cin >> a >> b; a--; b--;
			edge[a].push_back(b);
			edge[b].push_back(a);
		}
	}
	void solve(int m) {
		ReadGraph(m);
		int k = 0;
		rep(i, sz) {
			if (used[i])continue;
			k = dfs(i, k);
		}
	}
	int dfs(int v, int k, int p = -1) {
		used[v] = true;
		ord[v] = k;
		low[v] = k;
		k++;
		bool isaps = false;
		int child = 0;
		for (auto nv : edge[v]) {
			if (p == nv)continue;
			if (!used[nv]) {
				child++;
				k = dfs(nv, k, v);
				chmin(low[v], low[nv]);
				if ((-1 != p) && (ord[v] <= low[nv]))isaps = true;
				if (ord[v] < low[nv])bridges.emplace_back(v, nv);
			}
			else {
				chmin(low[v], ord[nv]);
			}
		}
		if ((-1 == p) && (child >= 2))isaps = true;
		if (isaps)aps.push_back(v);
		return k;
	}
};
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m, q; cin >> n >> m >> q;
	Lowlink lowlink(n);
	lowlink.solve(m);
	auto v = lowlink.bridges;
	dsu uf(n);
	rep(i, v.size()) uf.merge(v[i].first, v[i].second);
	rep(i, q) {
		int x, y; cin >> x >> y; x--, y--;
		if (uf.same(x, y))cout << "Yes" << endl;
		else cout << "No" << endl;
	}
	return 0;
}