use std::io::Write;
use std::collections::*;

type Map<K, V> = BTreeMap<K, V>;
type Set<T> = BTreeSet<T>;
type Deque<T> = VecDeque<T>;

fn run() {
    input! {
        n: usize,
        m: usize,
        p: [usize1; n],
        e: [(usize1, usize1); m],
        q: usize,
        ask: [(usize1, usize1); q],
    }
    let mut e = e;
    e.retain(|e| e.0 != e.1);
    let batch = 150;
    let mut g = vec![vec![]; n];
    for &(a, b) in e.iter() {
        g[a].push(b);
        g[b].push(a);
    }
    let mut set = vec![vec![]; n];
    for (i, set) in set.iter_mut().enumerate() {
        if g[i].len() > batch {
            *set = vec![0u32; n];
        }
    }
    for i in 0..n {
        if g[i].len() <= batch {
            for &v in g[i].iter() {
                if !set[v].is_empty() {
                    set[v][p[i]] += 1;
                }
            }
        }
    }
    let mut p = p;
    let out = std::io::stdout();
    let mut out = std::io::BufWriter::new(out.lock());
    for (x, y) in ask {
        let ans = if p[x] != p[y] {
            let u = p[y];
            let ok = if g[x].len() <= batch {
                g[x].iter().any(|v| p[*v] == u)
            } else {
                set[x][u] > 0
            };
            if ok {
                if g[x].len() <= batch {
                    for &v in g[x].iter() {
                        if !set[v].is_empty() {
                            set[v][p[x]] -= 1;
                            set[v][u] += 1;
                        }
                    }
                }
                p[x] = u;
                "Yes"
            } else {
                "No"
            }
        } else {
            "No"
        };
        writeln!(out, "{}", ans).ok();
    }
}

fn main() {
    run();
}

// ---------- begin input macro ----------
// reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
#[macro_export]
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

#[macro_export]
macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};
    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

#[macro_export]
macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };
    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };
    ($iter:expr, bytes) => {
        read_value!($iter, String).bytes().collect::<Vec<u8>>()
    };
    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };
    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}
// ---------- end input macro ----------