rt

#include <bits/stdc++.h>
using namespace std;
#define MAXN 5000

int n, m, p, fa[MAXN+5];

int find(int x) {
    if (fa[x] == x) return x;
    return fa[x] = find(fa[x]);
}

int main() {
    scanf("%d%d%d", &n, &m, &p);
    for (int i=1; i <= n; i++) fa[i]=i;
    for (int i=1; i <= m; i++) {
        int x, y;
        scanf("%d%d", &x, &y);
        fa[find(y)] = fa[x];
    }
    for (int i=1; i <= p; i++) {
        int x, y;
        scanf("%d%d", &x, &y);
        if (find(x) == find(y)) printf("Yes\n");
        else printf("No\n");
    }
    return 0;
}