// ---------- begin Lowest Common Ancestor ----------
struct LCA {
    graph: Vec<Vec<usize>>,
    path_root: Vec<usize>,
    path_parent: Vec<usize>,
    index: Vec<usize>
}

impl LCA {
    fn new(n: usize) -> Self {
        LCA {
            graph: vec![vec![]; n],
            path_root: vec![],
            path_parent: vec![],
            index: vec![],
        }
    }
    fn add_edge(&mut self, a: usize, b: usize) {
        self.graph[a].push(b);
        self.graph[b].push(a);
    }
    fn build(&mut self, root: usize) {
        let mut q = vec![];
        let mut stack = vec![(root, root)];
        let graph = &mut self.graph;
        while let Some((v, p)) = stack.pop() {
            q.push(v);
            for i in 0..graph[v].len() {
                if graph[v][i] == p {
                    graph[v].swap_remove(i);
                    break;
                }
            }
            for &u in &graph[v] {
                stack.push((u, v));
            }
        }
        let n = graph.len();
        let mut size = vec![1; n];
        for &v in q.iter().rev() {
            for i in 0..graph[v].len() {
                let u = graph[v][i];
                size[v] += size[u];
                if size[u] > size[graph[v][0]] {
                    graph[v].swap(0, i);
                }
            }
        }
        let mut path_root = vec![root; n];
        let mut path_parent = vec![root; n];
        let mut index = vec![n; n];
        let mut stack = vec![root];
        let mut k = 0;
        while let Some(v) = stack.pop() {
            index[v] = k;
            k += 1;
            for i in 1..graph[v].len() {
                let u = graph[v][i];
                path_root[u] = u;
                path_parent[u] = v;
                stack.push(u);
            }
            if graph[v].len() > 0 {
                let u = graph[v][0];
                path_root[u] = path_root[v];
                path_parent[u] = path_parent[v];
                stack.push(u);
            }
        }
        self.path_root = path_root;
        self.path_parent = path_parent;
        self.index = index;
    }
    fn query(&self, mut a: usize, mut b: usize) -> usize {
        let path = &self.path_root;
        let parent = &self.path_parent;
        let index = &self.index;
        while path[a] != path[b] {
            if index[a] < index[b] {
                b = parent[b];
            } else {
                a = parent[a];
            }
        }
        if index[a] < index[b] {a} else {b}
    }
}
// ---------- end Lowest Common Ancestor ----------

use std::io::Read;

fn run() {
    let mut s = String::new();
    std::io::stdin().read_to_string(&mut s).unwrap();
    let mut it = s.trim().split_whitespace();
    let n: usize = it.next().unwrap().parse().unwrap();
    let mut g = vec![vec![]; n];
    let mut lca = LCA::new(n);
    for _ in 1..n {
        let a: usize = it.next().unwrap().parse().unwrap();
        let b: usize = it.next().unwrap().parse().unwrap();
        g[a - 1].push(b - 1);
        g[b - 1].push(a - 1);
        lca.add_edge(a - 1, b - 1);
    }
    lca.build(0);
    let mut q = vec![];
    let mut parent = vec![0; n];
    let mut stack = vec![0];
    while let Some(v) = stack.pop() {
        q.push(v);
        if let Some(k) = g[v].iter().position(|u| *u == parent[v]) {
            g[v].swap_remove(k);
        }
        for &u in g[v].iter() {
            parent[u] = v;
            stack.push(u);
        }
    }
    let m: usize = it.next().unwrap().parse().unwrap();
    let mut cond = vec![];
    for _ in 0..m {
        let a: usize = it.next().unwrap().parse().unwrap();
        let b: usize = it.next().unwrap().parse().unwrap();
        cond.push((a - 1, b - 1));
    }
    let mut ans = 0i64;
    for i in 0..(1usize << m) {
        let mut imos = vec![0i32; n];
        let mut sign = 1;
        for (j, &(a, b)) in cond.iter().enumerate() {
            if (i >> j) & 1 == 1 {
                sign *= -1;
                imos[a] += 1;
                imos[b] += 1;
                imos[lca.query(a, b)] -= 2;
            }
        }
        let mut c = 0;
        for &v in q[1..].iter().rev() {
            if imos[v] == 0 {
                c += 1;
            }
            imos[parent[v]] += imos[v];
        }
        ans += sign * (1 << c);
    }
    println!("{}", ans);
}

fn main() {
    run();
}


Measured memory_bytes: 4352