### BUGGY CODE ###

N = int(input())
G = [[] for _ in range(N)]
Edges = []
for _ in range(N-1):
    a, b = sorted(map(int, input().split()))
    a -= 1
    b -= 1
    G[a].append(b)
    G[b].append(a)
    Edges.append((a, b))
def dfs(v, target, p, Path):
    if v == target:
        Path.append(v)
        return True
    for u in G[v]:
        if p != u:
            f = dfs(u, target, v, Path)
            if f:
                Path.append(v)
                return True
    return False
M = int(input())
UV = [list(map(lambda x: int(x)-1, input().split())) for _ in range(M)]
Ok = [0] * (N-1)
for idx_UV, (a, b) in enumerate(UV):
    Path = []
    dfs(a, b, -1, Path)
    for v, u in zip(Path, Path[1:]):
        v, u = sorted([v, u])
        idx_Edge = Edges.index((v, u))
        Ok[idx_Edge] |= 1<<idx_UV

def solve_half(Ok_half):
    # 半分の辺について全探索
    n = len(Ok_half)
    res = [0] * (1<<M)
    for set_black in range(1<<n):
        r = 0
        for i, Ok_i in enumerate(Ok_half):
            if set_black>>i&1:
                r |= Ok_i
        res[r] += 1
    return res

A = solve_half(Ok[:(N-1)//2])
B = solve_half(Ok[(N-1)//2:])

def fwt(A):
    n = len(A)
    for i in range(n.bit_length()-1):
        i = 1<<i
        for j in range(n):
            if i&j == 0:
                A[j|i] += A[j]
    return A

def ifwt(A):
    n = len(A)
    for i in range(n.bit_length()-1):
        i = 1<<i
        for j in range(n):
            if i&j == 0:
                A[j|i] -= A[j]
    return A

A = fwt(A)
B = fwt(B)
AB = [a*b for a, b in zip(A, B)]
AB = ifwt(AB)
print(AB[-1])


### FIXED CODE ###

import numpy as np

def numba_compile(numba_config):
    import os, sys
    if sys.argv[-1] == "ONLINE_JUDGE":
        from numba import njit
        from numba.pycc import CC
        cc = CC("my_module")
        for func, signature in numba_config:
            vars()[func.__name__] = njit(signature)(func)
            cc.export(func.__name__, signature)(func)
        cc.compile()
        exit()
    elif os.name == "posix":
        exec(f"from my_module import {','.join(func.__name__ for func, _ in numba_config)}")
        for func, _ in numba_config:
            globals()[func.__name__] = vars()[func.__name__]
    else:
        from numba import njit
        for func, signature in numba_config:
            globals()[func.__name__] = njit(signature, cache=True)(func)
        print("compiled!", file=sys.stderr)

    
def solve(N, M, Ok):
    def solve_half(Ok_half):
        # 半分の辺について全探索
        n = len(Ok_half)
        res = [0] * (1<<M)
        for set_black in range(1<<n):
            r = 0
            for i, Ok_i in enumerate(Ok_half):
                if set_black>>i&1:
                    r |= Ok_i
            res[r] += 1
        return res

    A = solve_half(Ok[:(N-1)//2])
    B = solve_half(Ok[(N-1)//2:])

    def fwt(A):
        n = len(A)
        #for i in range(n.bit_length()-1):
        for i in range(int(np.log2(n))):
            i = 1<<i
            for j in range(n):
                if i&j == 0:
                    A[j|i] += A[j]
        return A

    def ifwt(A):
        n = len(A)
        #for i in range(n.bit_length()-1):
        for i in range(int(np.log2(n))):
            i = 1<<i
            for j in range(n):
                if i&j == 0:
                    A[j|i] -= A[j]
        return A

    A = fwt(A)
    B = fwt(B)
    AB = [a*b for a, b in zip(A, B)]
    AB = ifwt(AB)
    return AB[-1]

numba_compile([
    [solve, "i8(i8,i8,i8[:])"],
])

def main():
    N = int(input())
    G = [[] for _ in range(N)]
    Edges = []
    for _ in range(N - 1):
        a, b = sorted(map(int, input().split()))
        a -= 1
        b -= 1
        G[a].append(b)
        G[b].append(a)
        Edges.append((a, b))

    def dfs(v, target, p, Path):
        if v == target:
            Path.append(v)
            return True
        for u in G[v]:
            if p != u:
                f = dfs(u, target, v, Path)
                if f:
                    Path.append(v)
                    return True
        return False

    M = int(input())
    UV = [list(map(lambda x: int(x) - 1, input().split())) for _ in range(M)]
    Ok = [0] * (N - 1)
    for idx_UV, (a, b) in enumerate(UV):
        Path = []
        dfs(a, b, -1, Path)
        for v, u in zip(Path, Path[1:]):
            v, u = sorted([v, u])
            idx_Edge = Edges.index((v, u))
            Ok[idx_Edge] |= 1 << idx_UV
    print(solve(N, M, np.array(Ok, dtype=np.int64)))

main()