using System;
using System.Collections;
using System.Collections.Generic;
using System.IO;
using System.Linq;
using System.Numerics;
using System.Text;
using System.Threading.Tasks;

namespace AtCorder
{
	public class Program
	{
		static List<Edge>[] to_;
		static void Main(string[] args)
		{
			var cin = new Scanner2();
			int n = cin.Int();
			to_ = new List<Edge>[n];
			for (int i = 0; i < n; i++) {
				to_[i] = new List<Edge>();
			}

			for (int i = 0; i < n - 1; i++) {
				int a = cin.Int() - 1;
				int b = cin.Int() - 1;
				to_[a].Add(new Edge(b, i));
				to_[b].Add(new Edge(a, i));
			}

			int m = cin.Int();
			var edgeBits = new long[m];
			for (int i = 0; i < m; i++) {
				int u = cin.Int() - 1;
				int v = cin.Int() - 1;
				var root = new List<long>();
				DFS(u, v, -1, root);

				foreach (int e in root) {
					edgeBits[i] |= (1L << e);
				}
			}

			long ans = 0;
			for (ulong i = 0; i < 1UL << m; i++) {
				ulong flag = 0;
				for (int j = 0; j < m; j++) {
					if (((1UL << j) & i) != 0) {
						flag |= (ulong)edgeBits[j];
					}
				}

				int whiteCount = PopCount(flag);
				long temp = 1L << (n - 1 - whiteCount);
				if (PopCount(i) % 2 == 0) {
					ans += temp;
				} else {
					ans -= temp;
				}
			}

			Console.WriteLine(ans);
		}

		static bool DFS(int src, int dst, int pre, List<long> root)
		{
			if (src == dst) {
				return true;
			}

			foreach (var next in to_[src]) {
				if (next.To == pre) {
					continue;
				}

				if (DFS(next.To, dst, src, root)) {
					root.Add(next.ID);
					return true;
				}
			}

			return false;
		}

		static int PopCount(ulong bits)
		{
			bits = ((bits & 0xaaaaaaaaaaaaaaaa) >> 1) + (bits & 0x5555555555555555);
			bits = ((bits & 0xcccccccccccccccc) >> 2) + (bits & 0x3333333333333333);
			bits = ((bits & 0xf0f0f0f0f0f0f0f0) >> 4) + (bits & 0x0f0f0f0f0f0f0f0f);
			bits = ((bits & 0xff00ff00ff00ff00) >> 8) + (bits & 0x00ff00ff00ff00ff);
			bits = ((bits & 0xffff0000ffff0000) >> 16) + (bits & 0x0000ffff0000ffff);
			bits = ((bits & 0xffffffff00000000) >> 32) + (bits & 0x00000000ffffffff);

			return (int)bits;
		}
	}

	struct Edge
	{
		public int To;
		public int ID;
		public Edge(int to, int id)
		{
			To = to;
			ID = id;
		}
	}

	public class Scanner2
	{
		private readonly char[] delimiter_ = new char[] { ' ' };
		private readonly string filePath_;
		private string[] buf_;
		private int index_;
		Func<string> reader_;

		public Scanner2(string file = "")
		{
			if (string.IsNullOrWhiteSpace(file)) {
				reader_ = Console.ReadLine;
			} else {
				filePath_ = file;
				var fs = new StreamReader(file);
				reader_ = fs.ReadLine;
			}
			buf_ = new string[0];
			index_ = 0;
		}

		public string Next()
		{
			if (index_ < buf_.Length) {
				return buf_[index_++];
			}

			string st = reader_();
			while (st == "") {
				st = reader_();
			}

			buf_ = st.Split(delimiter_, StringSplitOptions.RemoveEmptyEntries);
			if (buf_.Length == 0) {
				return Next();
			}

			index_ = 0;
			return buf_[index_++];
		}

		public int Int() => int.Parse(Next());
		public long Long() => long.Parse(Next());
		public double Double() => double.Parse(Next());

		public int[] ArrayInt(int N, int add = 0)
		{
			int[] Array = new int[N];
			for (int i = 0; i < N; i++) {
				Array[i] = Int() + add;
			}
			return Array;
		}

		public long[] ArrayLong(int N, long add = 0)
		{
			long[] Array = new long[N];
			for (int i = 0; i < N; i++) {
				Array[i] = Long() + add;
			}
			return Array;
		}

		public double[] ArrayDouble(int N, double add = 0)
		{
			double[] Array = new double[N];
			for (int i = 0; i < N; i++) {
				Array[i] = Double() + add;
			}
			return Array;
		}

		public void Save(string text)
		{
			if (string.IsNullOrWhiteSpace(filePath_)) {
				return;
			}

			File.WriteAllText(filePath_ + "_output.txt", text);
		}
	}
}

Measured memory_bytes: 13396