(defparameter *tree* nil)

(defun solve (a fs)
(let ((p 1.0)
(tr *tree*))
(loop do
(setf p (* p (car tr))
tr (if (member (cadr tr) fs)
(caddr tr)
(cadddr tr)))
while tr
finally (return p))))

(loop for i from 1 to (read) do
(format t "Case #~D:~%" i)
(read)
(let ((*tree* (read)))
(let ((n (read)))
(dotimes (_ n)
(format t "~F~%" (solve (read) (loop repeat (read) collect (read))))))))