open Printf
open Scanf

let () =
  let n, m = scanf "%d %d " (fun x y -> (x, y)) in
  let g = Array.make n [] in
  let rec set_graph x =
    if x = 0 then ()
    else begin
        let u, v = scanf "%d %d " (fun x y -> (x, y)) in
        g.(u) <- v :: g.(u);
        g.(v) <- u :: g.(v);
        set_graph (x-1)
      end
  in
  let friend u v =
    let que = Queue.create () in
    let vt = Array.make n true in
    let rec loop () =
      if Queue.is_empty que then false
      else let i = Queue.pop que in
           if i = v then true
           else begin
               List.iter (fun j ->
                          if vt.(j) then begin
                              Queue.push j que; 
                              vt.(j) <- false
                            end) g.(i);
               loop ()
             end
    in
    Queue.push u que;
    vt.(u) <- false;
    loop ()
  in
  let rec iter x =
    if x = 0 then ()
    else begin
        let u, v = scanf "%d %d " (fun x y -> (x, y)) in
        printf "%s\n" (if friend u v then "yes" else "no");
        iter (x-1)
      end
  in
  set_graph m;
  let q = scanf "%d " (fun x -> x) in
  iter q