#[allow(unused_imports)]
use std::cmp::Ordering;

#[allow(unused_imports)]
use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, VecDeque};

#[allow(unused_imports)]
use std::io::{stdin, stdout, BufWriter, Write};

#[allow(unused_imports)]
use std::iter::FromIterator;

#[allow(unused_macros)]
macro_rules! min {
    ($x: expr) => ($x);
    ($x: expr, $($z: expr),+) => {{
        std::cmp::min($x, min!($($z),*))
    }}
}

#[allow(unused_macros)]
macro_rules! max {
    ($x: expr) => ($x);
    ($x: expr, $($z: expr),+) => {{
        std::cmp::max($x, max!($($z),*))
    }}
}

#[allow(unused_macros)]
macro_rules! get {
    ([$t: ty]) => {
        {
            let mut line = String::new();
            stdin().read_line(&mut line).unwrap();
            line.split_whitespace().map(|t|t.parse::<$t>().unwrap()).collect::<Vec<_>>()
        }
    };
    ([$t: ty];$n: expr) => {
        (0..$n).map(|_|get!([$t])).collect::<Vec<_>>()
    };
    ($t: ty) => {
        {
            let mut line = String::new();
            stdin().read_line(&mut line).unwrap();
            line.trim().parse::<$t>().unwrap()
        }
    };
    ($($t: ty),*) => {
        {
            let mut line = String::new();
            stdin().read_line(&mut line).unwrap();
            let mut iter = line.split_whitespace();
            ($(iter.next().unwrap().parse::<$t>().unwrap(),)*)
        }
    };
    ($t: ty; $n: expr) => {
        (0..$n).map(|_|get!($t)).collect::<Vec<_>>()
    };
    ($($t: ty),*; $n: expr) => {
        (0..$n).map(|_|get!($($t),*)).collect::<Vec<_>>()
    };
}

#[allow(unused_macros)]
macro_rules! debug {
    ($($a:expr),*) => {
        #[cfg(debug_assertions)]
        writeln!(&mut std::io::stderr(), concat!("[DEBUG] ", $(stringify!($a), "={:?} "),*), $($a),*).unwrap();
    }
}

const BIG_STACK_SIZE: bool = true;

#[allow(dead_code)]
fn main() {
    use std::thread;
    if BIG_STACK_SIZE {
        thread::Builder::new()
            .stack_size(32 * 1024 * 1024)
            .name("solve".into())
            .spawn(solve)
            .unwrap()
            .join()
            .unwrap();
    } else {
        solve();
    }
}

fn solve() {
    let n = get!(usize);
    let ab = get!(usize, usize;n-1);
    let m = get!(usize);
    let uv = get!(usize, usize; m);

    let mut nodes = vec![Vec::new(); n + 1];
    let mut set = BTreeSet::new();
    for (a, b) in ab {
        nodes[a].push(b);
        nodes[b].push(a);
        set.insert((min!(a, b), max!(a, b)));
    }

    let mut map = HashMap::new();
    for (i, e) in set.into_iter().enumerate() {
        map.insert(e, i);
    }

    let mut vec = Vec::new();
    for (u, v) in uv {
        let mut queue = VecDeque::new();
        let mut prev = vec![None; n + 1];
        queue.push_back(u);
        prev[u] = Some(0);
        while let Some(node) = queue.pop_front() {
            for &next in &nodes[node] {
                if prev[next].is_some() {
                    continue;
                }
                prev[next] = Some(node);
                queue.push_back(next);
            }
        }
        let mut node = v;
        let mut num = 0usize;
        while let Some(next) = prev[node] {
            let l = min!(next, node);
            let r = max!(next, node);
            num |= 1usize << map.get(&(l, r)).unwrap();
            if next == u {
                break;
            }
            node = next;
        }
        vec.push(num);
    }

    let mut res = 0isize;
    for i in 1..1usize << m {
        let mut num = 0;
        for j in 0..m {
            if (i >> j) & 1 == 1 {
                num |= vec[j];
            }
        }
        let c = i.count_ones();
        if c % 2 == 0 {
            res -= 2isize.pow((n - 1) as u32 - num.count_ones());
        } else {
            res += 2isize.pow((n - 1) as u32 - num.count_ones());
        }
    }
    println!("{}", 2isize.pow((n - 1) as u32) - res);
}


Measured memory_bytes: 8572