using System;
using System.Collections;
using System.Collections.Generic;
using System.Diagnostics;
using System.Globalization;
using System.IO;
using System.Text;
using System.Linq;

using E = System.Linq.Enumerable;

internal partial class Solver {
    class Edge {
        public int From, To, Index;
    }

    public void Run() {
        var n = ni();
        var adj = Enumerable.Range(0, n).Select(_ => new List<Edge>()).ToArray();
        for (int i = 0; i < n - 1; i++) {
            var a = ni() - 1;
            var b = ni() - 1;
            adj[a].Add(new Edge { From = a, To = b, Index = i });
            adj[b].Add(new Edge { From = b, To = a, Index = i });
        }
        var m = ni();
        var u = new int[m];
        var v = new int[m];
        for (int i = 0; i < m; i++) {
            u[i] = ni() - 1;
            v[i] = ni() - 1;
        }
        var usedEdgeIds = Enumerable.Range(0, m).Select(_ => new List<int>()).ToArray();

        for (int i = 0; i < m; i++) {
            var start = u[i];
            var queue = new Queue<Tuple<int, Edge>>();
            queue.Enqueue(Tuple.Create(start, (Edge)null));
            var visited = new bool[n];
            var edges = new Edge[n];
            while (queue.Count > 0) {
                var pair = queue.Dequeue();
                var current = pair.Item1;
                var edge = pair.Item2;
                if (visited[current]) continue;
                visited[current] = true;
                edges[current] = edge;
                if (current == v[i]) break;

                foreach (var e in adj[current]) {
                    if (visited[e.To]) continue;
                    queue.Enqueue(Tuple.Create(e.To, e));
                }
            }
            {
                int current = v[i];
                while (current != start) {
                    var e = edges[current];
                    usedEdgeIds[i].Add(e.Index);
                    current = e.From;
                }
            }
        }

        long ans = 1L << (n - 1);

        for (int bit = 1; bit < (1 << m); bit++) {
            var usedEdge = new bool[n - 1];
            int parity = 0;
            int freeEdgeNum = n - 1;
            for (int i = 0; i < m; i++) {
                if ((bit & (1 << i)) != 0) {
                    parity++;
                    foreach (var eid in usedEdgeIds[i]) {
                        if (!usedEdge[eid]) {
                            freeEdgeNum--;
                            usedEdge[eid] = true;
                        }
                    }
                }
            }
            long pattern = 1L << freeEdgeNum;
            if (parity % 2 == 1) {
                ans -= pattern;
            } else {
                ans += pattern;
            }
        }

        cout.WriteLine(ans);
    }
}

// PREWRITEN CODE BEGINS FROM HERE
internal partial class Solver : Scanner {
    public static void Main(string[] args) {
#if LOCAL
        byte[] inputBuffer = new byte[1000000];
        var inputStream = Console.OpenStandardInput(inputBuffer.Length);
        using (var reader = new StreamReader(inputStream, Console.InputEncoding, false, inputBuffer.Length)) {
            Console.SetIn(reader);
            new Solver(Console.In, Console.Out).Run();
        }
#else
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver(Console.In, Console.Out).Run();
        Console.Out.Flush();
#endif
    }

#pragma warning disable IDE0052
    private readonly TextReader cin;
    private readonly TextWriter cout;
#pragma warning restore IDE0052

    public Solver(TextReader reader, TextWriter writer)
        : base(reader) {
        cin = reader;
        cout = writer;
    }
    public Solver(string input, TextWriter writer)
        : this(new StringReader(input), writer) {
    }

#pragma warning disable IDE1006
#pragma warning disable IDE0051
    private int ni() { return NextInt(); }
    private int[] ni(int n) { return NextIntArray(n); }
    private long nl() { return NextLong(); }
    private long[] nl(int n) { return NextLongArray(n); }
    private double nd() { return NextDouble(); }
    private double[] nd(int n) { return NextDoubleArray(n); }
    private string ns() { return Next(); }
    private string[] ns(int n) { return NextArray(n); }
#pragma warning restore IDE1006
#pragma warning restore IDE0051
}

internal static class LinqPadExtension {
    [Conditional("DEBUG")]
    public static void Dump<T>(this T obj) {
#if DEBUG
        LINQPad.Extensions.Dump(obj);
#endif
    }
}

public class Scanner {
    private readonly TextReader Reader;
    private readonly CultureInfo ci = CultureInfo.InvariantCulture;

    private readonly char[] buffer = new char[2 * 1024];
    private int cursor = 0, length = 0;
    private string Token;
    private readonly StringBuilder sb = new StringBuilder(1024);

    public Scanner()
        : this(Console.In) {
    }

    public Scanner(TextReader reader) {
        Reader = reader;
    }

    public int NextInt() { return (int)NextLong(); }
    public long NextLong() {
        var s = Next();
        long r = 0;
        int i = 0;
        bool negative = false;
        if (s[i] == '-') {
            negative = true;
            i++;
        }
        for (; i < s.Length; i++) {
            r = r * 10 + (s[i] - '0');
#if DEBUG
            if (!char.IsDigit(s[i])) throw new FormatException();
#endif
        }
        return negative ? -r : r;
    }
    public double NextDouble() { return double.Parse(Next(), ci); }
    public string[] NextArray(int size) {
        string[] array = new string[size];
        for (int i = 0; i < size; i++) {
            array[i] = Next();
        }

        return array;
    }
    public int[] NextIntArray(int size) {
        int[] array = new int[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextInt();
        }

        return array;
    }

    public long[] NextLongArray(int size) {
        long[] array = new long[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextLong();
        }

        return array;
    }

    public double[] NextDoubleArray(int size) {
        double[] array = new double[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextDouble();
        }

        return array;
    }

    public string Next() {
        if (Token == null) {
            if (!StockToken()) {
                throw new InvalidOperationException();
            }
        }
        var token = Token;
        Token = null;
        return token;
    }

    public bool HasNext() {
        if (Token != null) {
            return true;
        }

        return StockToken();
    }

    private bool StockToken() {
        while (true) {
            sb.Clear();
            while (true) {
                if (cursor >= length) {
                    cursor = 0;
                    if ((length = Reader.Read(buffer, 0, buffer.Length)) <= 0) {
                        break;
                    }
                }
                var c = buffer[cursor++];
                if (33 <= c && c <= 126) {
                    sb.Append(c);
                } else {
                    if (sb.Length > 0) break;
                }
            }

            if (sb.Length > 0) {
                Token = sb.ToString();
                return true;
            }

            return false;
        }
    }
}

Measured memory_bytes: 17836