#!/usr/bin/ruby
# -*- coding: utf-8 -*-
=begin
ALDS1_5-A
Recursion / Divide and Conquer - Exhaustive Search
????????¶??? : 5 sec, ?????¢?????¶??? : 65536 KB
=end

class Main
  def sum(f)
    f.inject(0){|acc,x| acc + x}
  end

  def issum(v, f)
    return false if v > sum(f)
    g = f.select{|x| x <= v}
    h = []
    1.upto(g.length) {|i|
      h = g.combination(i).to_a.map{|w| sum(w)}.select{|x| x == v}
      return true if h.length>0
    }
    return false
  end

=begin
    1.upto(g.length) {|i|
      h = h + g.combination(i).to_a

    }
    l=h.map{|w| sum(w)}
    m = l.select{|x| x == v}
    if m.length>0 then
      return true
    else
      return false
    end
=end

  def initialize
    #fh=open("/home/muz/Downloads/ALDS1_5_A_in1.txt")
    #fh=open("/home/muz/Downloads/ALDS1_5_A_in10.txt")
    fh=STDIN
    n=fh.gets.chomp.to_i
    f=fh.gets.chomp.split.map{|x| x.to_i}
    q=fh.gets.chomp.to_i
    g=fh.gets.chomp.split.map{|x| x.to_i}
    fh.close
    g.each{|y|
      puts issum(y,f) ? "yes" : "no"
    }
  end

end

if $0==__FILE__ then
  Main.new()
end