#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100010;
const int MAXM = 100010;
int n, m;
struct edge {
  int ne, to, val;
  edge(int N = 0, int T = 0) : ne(N), to(T) {}
} e[MAXM << 1];
int fir[MAXN], num = 1;
inline void join(int a, int b) {
  e[++num] = edge(fir[a], b);
  fir[a] = num;
}
int dfn[MAXN], low[MAXN], cnt = 0, stk[MAXN], top = 0, tot = 0, pos[MAXM << 1];
vector<int> dv[MAXN], de[MAXN];
int col[MAXN];
bool vis[MAXN];
int dep[MAXN], anc[MAXN][20], lg[MAXN];
void tarjan(int u, int la) {
  dfn[u] = low[u] = ++cnt;
  for (int i = fir[u]; i; i = e[i].ne) {
    if (i == (la ^ 1) || pos[i]) continue;
    int v = e[i].to;
    stk[++top] = i;
    if (!dfn[v]) {
      tarjan(v, i);
      low[u] = min(low[u], low[v]);
      if (low[v] >= dfn[u]) {
        int x = 0;
        dv[++tot].push_back(u);
        do {
          x = stk[top--];
          pos[x] = pos[x ^ 1] = tot;
          dv[tot].push_back(e[x].to);
          de[tot].push_back(x);
        } while (x != i);
      }
    } else
      low[u] = min(low[u], dfn[v]);
  }
}
bool color(int u, int la, int c) {
  if (~col[u]) return col[u] == col[e[la ^ 1].to];
  col[u] = c;
  for (int i = fir[u]; i; i = e[i].ne) {
    if (pos[i] != pos[la] || i == (la ^ 1)) continue;
    int v = e[i].to;
    if (color(v, i, c ^ 1)) return 1;
  }
  return 0;
}
int sum[MAXN];
void dfs(int u, int fa) {
  dep[u] = dep[anc[u][0] = fa] + 1;
  for (int i = 1; i <= lg[dep[u]]; i++) anc[u][i] = anc[anc[u][i - 1]][i - 1];
  vis[u] = 1;
  for (int i = fir[u]; i; i = e[i].ne) {
    int v = e[i].to;
    if (vis[v]) continue;
    sum[v] = sum[u] + e[i].val;
    dfs(v, u);
  }
}
inline int LCA(int x, int y) {
  if (dep[x] < dep[y]) swap(x, y);
  for (int i = lg[dep[x]]; ~i; i--)
    if (dep[anc[x][i]] >= dep[y]) x = anc[x][i];
  if (x == y) return x;
  for (int i = lg[dep[x]]; ~i; i--)
    if (anc[x][i] != anc[y][i]) x = anc[x][i], y = anc[y][i];
  return anc[x][0];
}
int pa[MAXN];
int find(int x) { return pa[x] == x ? x : pa[x] = find(pa[x]); }
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; i++) pa[i] = i;
  for (int i = 1; i <= m; i++) {
    int x, y;
    scanf("%d%d", &x, &y);
    join(x, y);
    join(y, x);
    pa[find(x)] = find(y);
  }
  for (int i = 2; i <= n; i++) lg[i] = lg[i >> 1] + 1;
  for (int i = 1; i <= n; i++)
    if (!dfn[i]) tarjan(i, 0);
  for (int i = 1; i <= tot; i++) {
    for (int j = 0; j < (int)dv[i].size(); j++) col[dv[i][j]] = -1;
    pos[0] = i;
    if (color(dv[i][0], 0, 0)) {
      for (int j = 0; j < (int)de[i].size(); j++) e[de[i][j]].val = 1;
    }
  }
  for (int i = 1; i <= n; i++)
    if (!vis[i]) dfs(i, 0);
  int q;
  scanf("%d", &q);
  while (q--) {
    int x = -1, y = -1;
    scanf("%d%d", &x, &y);
    if (find(x) != find(y)) {
      puts("No");
      continue;
    }
    int z = LCA(x, y);
    if ((dep[x] + dep[y]) & 1)
      puts("Yes");
    else if (sum[x] + sum[y] - sum[z] * 2 > 0)
      puts("Yes");
    else
      puts("No");
  }
  return 0;
}
