import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)


class UnionFind:
    def __init__(self, n):
        self.root = [-1] * (n + 1)

    def find(self, x):
        stack = []
        while self.root[x] >= 0:
            stack.append(x)
            x = self.root[x]
        for i in stack:
            self.root[i] = x
        return x

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def unite(self, x, y):
        x = self.find(x)
        y = self.find(y)
        if x == y:
            return False
        if -self.root[x] > -self.root[y]:
            x, y = y, x
        self.root[y] += self.root[x]
        self.root[x] = y
        return True

    def size(self, x):
        return -self.root[self.find(x)]


N, M, Q = map(int, input().split())
G = [[] for _ in range(N)]
for _ in range(M):
    a, b = map(int, input().split())
    a -= 1
    b -= 1
    G[a].append(b)
    G[b].append(a)

X = [0] * N
itr = [0] * N
depth = [-1] * N
par = [-1] * N

for r in range(N):
    if depth[r] != -1:
        continue
    depth[r] = 0
    que = [(r, -1)]  # node, parent
    while que:
        s, p = que[-1]
        if itr[s] < len(G[s]):
            t = G[s][itr[s]]
            itr[s] += 1
            if t == p:
                continue
            if depth[t] != -1 and depth[t] < depth[s]:
                X[s] += 1
                X[t] -= 1
            elif depth[t] == -1:
                depth[t] = depth[s] + 1
                que.append((t, s))
                par[t] = s
        else:
            X[p] += X[s]
            # topo.append((s, p))
            que.pop()


bridge = X

uf = UnionFind(N)
for i in range(N):
    if bridge[i] == 0:
        uf.unite(i, par[i])


leader = set(uf.find(i) for i in range(N))
group = {x: [] for x in leader}
for i in range(N):
    group[uf.find(i)].append(i)


for _ in range(Q):
    x, y = map(int, input().split())
    x -= 1
    y -= 1
    if uf.find(x) == uf.find(y):
        print("Yes")
    else:
        print("No")