#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10, maxm = maxn << 1;
int read() {
  int x = 0, f = 1;
  char c = getchar();
  while (!isdigit(c)) {
    if (c == '-') f = 0;
    c = getchar();
  }
  while (isdigit(c)) {
    x = (x << 3) + (x << 1) + (c ^ 48);
    c = getchar();
  }
  return f ? x : -x;
}
int to[maxm], nxt[maxm], head[maxn], e;
int dep[maxn], anc[20][maxn], w[maxn], vis[maxn];
void Add(int x, int y) {
  to[++e] = y;
  nxt[e] = head[x];
  head[x] = e;
  to[++e] = x;
  nxt[e] = head[y];
  head[y] = e;
}
void dfs(int u, int fa) {
  dep[u] = dep[fa] + 1;
  anc[0][u] = fa;
  for (int i = head[u]; i; i = nxt[i]) {
    int v = to[i];
    if (v == fa) continue;
    dfs(v, u);
  }
}
int lca(int u, int v) {
  if (dep[u] < dep[v]) swap(u, v);
  for (int i = 19; i >= 0; --i)
    if (dep[anc[i][u]] >= dep[v]) u = anc[i][u];
  if (u == v) return u;
  for (int i = 19; i >= 0; --i)
    if (anc[i][u] != anc[i][v]) u = anc[i][u], v = anc[i][v];
  return anc[0][u];
}
void gao(int u) {
  w[u] += w[anc[0][u]];
  for (int i = head[u]; i; i = nxt[i]) {
    int v = to[i];
    if (v == anc[0][u]) continue;
    gao(v);
  }
}
namespace tra {
int to[maxm], head[maxn], nxt[maxm], e;
void add(int x, int y) {
  to[++e] = y;
  nxt[e] = head[x];
  head[x] = e;
  to[++e] = x;
  nxt[e] = head[y];
  head[y] = e;
}
void dfs(int u, int fg) {
  vis[u] = fg;
  for (int i = head[u]; i; i = nxt[i]) {
    int v = to[i];
    if (vis[v]) continue;
    Add(u, v);
    dfs(v, fg);
  }
}
int dfn[maxn], low[maxn], top, tot;
pair<int, int> sta[maxn];
void tarjan(int u, int fa) {
  dfn[u] = low[u] = ++tot;
  for (int i = head[u]; i; i = nxt[i]) {
    int v = to[i];
    if (v == fa || dfn[v] > dfn[u]) continue;
    sta[++top] = make_pair(u, v);
    if (!dfn[v])
      tarjan(v, u), low[u] = min(low[u], low[v]);
    else
      low[u] = min(low[u], dfn[v]);
  }
  if (low[u] >= dfn[fa]) {
    int fg = 0;
    if (!top) return;
    int tmp = top;
    while (1) {
      if (!top) break;
      if ((dep[sta[top].first] & 1) == (dep[sta[top].second] & 1)) fg = 1;
      --top;
      if (sta[top + 1].first == fa && sta[top + 1].second == u) break;
    }
    if (!fg) return;
    top = tmp;
    while (1) {
      if (!top) break;
      if (anc[0][sta[top].first] == sta[top].second) w[sta[top].first]++;
      if (anc[0][sta[top].second] == sta[top].first) w[sta[top].second]++;
      --top;
      if (sta[top + 1].first == fa && sta[top + 1].second == u) break;
    }
  }
}
}  // namespace tra
int main() {
  int n = read(), m = read();
  for (int i = 1; i <= m; ++i) tra::add(read(), read());
  for (int i = 1; i <= n; ++i)
    if (!vis[i]) tra::dfs(i, i);
  for (int i = 1; i <= n; ++i)
    if (!dep[i]) dfs(i, 0);
  for (int i = 1; i <= 19; ++i)
    for (int j = 1; j <= n; ++j) anc[i][j] = anc[i - 1][anc[i - 1][j]];
  for (int i = 1; i <= n; ++i)
    if (vis[i] == i) tra::tarjan(i, 0), gao(i);
  int Q = read();
  while (Q--) {
    int x = read(), y = read();
    if (vis[x] != vis[y]) {
      puts("No");
      continue;
    }
    int tmp = lca(x, y);
    if (((dep[x] + dep[y] - dep[tmp] * 2) & 1) || w[x] + w[y] - w[tmp] * 2)
      puts("Yes");
    else
      puts("No");
  }
  return 0;
}
