#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repf(i, n, flag) for (int i = 0; i < (int)(n) && flag; i++)
#define all(v) v.begin(), v.end()


using EDGE = vector<int>;
using GRAPH = vector<EDGE>;

int n;
GRAPH g(int(2e5));
vector<bool> visited(int(2e5));
vector<int> vec;
dsu st(int(2e5));
dsu edge(int(2e5));

void dfs(int pos, int pre) {
    for(int x : g[pos]) {
        if(x == pre) continue;
        if(visited[x]) {
            for(int i = vec.size() - 1; i >= 0; i--) {
                if(vec[i] == x) break;
                st.merge(vec[i], x);
            }
        } else {
            vec.push_back(x);
            visited[x] = true;
            dfs(x, pos);
            vec.pop_back();
        }
    }
    if(st.size(pos) == 1)
        for(int x : g[pos]) edge.merge(pos, x);
}

int main() {
    int m, q;
    cin >> n >> m >> q;
    rep(i, m) {
        int u, v;
        cin >> u >> v;
        u--; v--;
        g[u].push_back(v);
        g[v].push_back(u);
    }

    dfs(0, -1);

    rep(i, q) {
        int x, y;
        cin >> x >> y;
        x--; y--;
        cout << (edge.same(x, y) ? "Yes" : "No") << endl;
    }
    return 0;
}