#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <vector>
#include <iomanip>
#include <math.h>
#include <map>
using namespace std;
#define FIN     freopen("input.txt","r",stdin);
#define FOUT    freopen("output.txt","w",stdout);
#define INF     0x3f3f3f3f
#define INFLL   0x3f3f3f3f3f3f3f
#define lson    l,m,rt<<1
#define rson    m+1,r,rt<<1|1
typedef long long LL;
typedef pair<int, int> PII;
using namespace std;const int MX = 1e5 + 10;struct Edge {int u, v, nxt;
} E[MX];
int Head[MX], erear;
void edge_init() {erear = 0;memset(Head, -1, sizeof(Head));
}
void edge_add(int u, int v) {E[erear].u = u;E[erear].v = v;E[erear].nxt = Head[u];Head[u] = erear++;
}
int n, m, IN[MX], cnt[MX], val[MX];
int bsz, ssz, dsz;
int Low[MX], DFN[MX];
void Init_tarjan(int n) {bsz = ssz = dsz = 0;for(int i = 1; i <= n; ++i) Low[i] = DFN[i] = 0;
}int Stack[MX], inStack[MX], Belong[MX];
void trajan(int u, int e) {inStack[u] = 1;Stack[++ssz] = u;DFN[u] = Low[u] = ++dsz;for(int i = Head[u]; ~i; i = E[i].nxt) {int v = E[i].v;if((i ^ 1) == e) continue;if(!DFN[v]) {trajan(v, i);Low[u] = min(Low[u], Low[v]);} else if(inStack[v]) {Low[u] = min(Low[u], Low[v]);}}if(DFN[u] == Low[u]) {bsz++; int v;do {v = Stack[ssz--];inStack[v] = 0;Belong[v] = bsz;} while(ssz && v != u);}
}
void tarjan_solve(int n) {dsz = bsz = ssz = 0;memset(DFN, 0, sizeof(DFN));for(int i = 1; i <= n; i++) {if(!DFN[i]) trajan(i, -1);}/*缩点*/edge_init();for(int i = 0; i < 2 * m; i += 2) {int u = E[i].u, v = E[i].v;u = Belong[u]; v = Belong[v];if(u == v) continue;edge_add(u, v);edge_add(v, u);}
}int main() {//FINint m, n;while(~scanf("%d%d", &m, &n)) {edge_init();for(int i = 1; i <= n; i++) {int u, v;scanf("%d%d", &u, &v);edge_add(u, v);edge_add(v, u);}tarjan_solve(n);int Q;scanf("%d", &Q);for(int i = 1; i <= Q; i++) {int u, v;scanf("%d%d", &u, &v);if(Belong[u] == Belong[v]) printf("Yes\n");else printf("No\n");}}return 0;
}