✅ 정답 공개
n,m=map(int,input().split())
parent=list(range(n+1))
def find(x):
if parent[x]!=x: parent[x]=find(parent[x])
return parent[x]
def union(x,y): parent[find(x)]=find(y)
for _ in range(m):
a,b=map(int,input().split()); union(a,b)
q=int(input())
for _ in range(q):
a,b=map(int,input().split())
print('YES' if find(a)==find(b) else 'NO')