A and B are preparing themselves for programming contests.

The University where A and B study is a set of rooms connected by corridors. Overall, the University has n rooms connected by n - 1 corridors so that you can get from any room to any other one by moving along the corridors. The rooms are numbered from 1 to n.

Every day А and B write contests in some rooms of their university, and after each contest they gather together in the same room and discuss problems. A and B want the distance from the rooms where problems are discussed to the rooms where contests are written to be equal. The distance between two rooms is the number of edges on the shortest path between them.

As they write contests in new rooms every day, they asked you to help them find the number of possible rooms to discuss problems for each of the following m days.

Input

The first line contains integer n (1 ≤ n ≤ 105) — the number of rooms in the University.

The next n - 1 lines describe the corridors. The i-th of these lines (1 ≤ i ≤ n - 1) contains two integers ai and bi (1 ≤ ai, bi ≤ n), showing that the i-th corridor connects rooms ai and bi.

The next line contains integer m (1 ≤ m ≤ 105) — the number of queries.

Next m lines describe the queries. The j-th of these lines (1 ≤ j ≤ m) contains two integers xj and yj (1 ≤ xj, yj ≤ n) that means that on the j-th day A will write the contest in the room xj, B will write in the room yj.

Output

In the i-th (1 ≤ i ≤ m) line print the number of rooms that are equidistant from the rooms where A and B write contest on the i-th day.

Examples

Input

4
1 2
1 3
2 4
1
2 3


Output

1


Input

4
1 2
2 3
2 4
2
1 2
1 3


Output

0
2

Note

in the first sample there is only one room at the same distance from rooms number 2 and 3 — room number 1.

import java.io.*;
import java.util.*;
import java.math.*;

public class Main {

	static long sx = 0, sy = 0, mod = (long) (998244353);

	static ArrayList<Integer>[] a;
	// static ArrayList<Long> p;
	// static HashMap<Integer, Integer> hm = new HashMap<>();
	static Integer[][][] dp;
	static long[] far;
	static int[] fa;
	public static PrintWriter out = new PrintWriter(System.out);
	static ArrayList<pair> pa = new ArrayList<>();
	static long[] fact = new long[(int) 1e6];
	static StringBuilder sb = new StringBuilder();
	static boolean cycle = false;
	static long m = 998244353;
	static int[] c, col;
	// static int n = 0, m, x, k;
	// static int ans = Integer.MAX_VALUE;
	static boolean b = false;
	static boolean[] reach = new boolean[6000];
	static int[][] par;
	static int[] depth;
	static int[] size;
	static long[] pow;
	static int time = 0;

	static pair[] p;

	static long ans = 0;

	public static void main(String[] args) throws IOException {

		// Scanner scn = new Scanner(new BufferedReader(new
		// InputStreamReader(System.in)));

		Reader scn = new Reader();

		int n = scn.nextInt();

		a = new ArrayList[n + 1];
		par = new int[n + 1][20];
		depth = new int[n + 1];
		size = new int[n + 1];

		for (int i = 0; i <= n; i++) {
			a[i] = new ArrayList<>();
			Arrays.fill(par[i], -1);

		}

		for (int i = 1; i <= n - 1; i++) {
			int x = scn.nextInt(), y = scn.nextInt();
			a[x].add(y);
			a[y].add(x);
		}

		dfs(1, 0);
		preprocess();

		int m = scn.nextInt();

		StringBuilder sb = new StringBuilder();

		while (m-- != 0) {

			int u = scn.nextInt(), v = scn.nextInt();

			int dis = dis(u, v);
			int lca = lca(u, v);

			int ans = -1;

			if (dis % 2 == 1)
				ans = 0;

			else if (u == v)
				ans = n;

			else if (dis(u, lca) == dis(v, lca)) {

				int d1 = dis(u, lca), d2 = dis(v, lca);

				ans = n - size[kthancestor(u, d1 - 1)] - size[kthancestor(v, d2 - 1)];

			}

			else {

				int k = dis / 2;

				if (dis(u, lca) > dis(v, lca)) {
					int t = v;
					v = u;
					u = t;
				}

				int kth = kthancestor(v, k);
				int kmo = kthancestor(v, k - 1);

				ans = size[kth] - size[kmo];
			}

			sb.append(ans);
			sb.append("\n");
		}

		out.print(sb);
		out.close();
	}

	public static int lca(int u, int v) {

		if (depth[v] < depth[u]) {
			int t = v;
			v = u;
			u = t;
		}

		int diff = depth[v] - depth[u];

		for (int i = 0; i < 18; i++) {

			if (((diff >> i) & 1) == 1)
				v = par[v][i];
		}

		if (u == v)
			return u;

		for (int i = 17; i >= 0; i--) {

			if (par[u][i] != par[v][i]) {
				u = par[u][i];
				v = par[v][i];
			}

		}

		return par[u][0];
	}

	public static int kthancestor(int v, int k) {

		for (int i = 0; i < 20 && v != -1; i++) {

			if (((k >> i) & 1) == 1)
				v = par[v][i];
		}

		return v;
	}

	public static int dis(int u, int v) {

		return depth[u] + depth[v] - 2 * depth[lca(u, v)];
	}

	private static void preprocess() {

		for (int j = 1; j < par[0].length; j++)
			for (int n = 1; n < par.length; n++)

				if (par[n][j - 1] != -1)
					par[n][j] = par[par[n][j - 1]][j - 1];

	}

	private static void dfs(int v, int p) {

		par[v][0] = p;
		depth[v] = depth[p] + 1;

		for (int nbr : a[v])
			if (nbr != p) {
				dfs(nbr, v);
				size[v] += size[nbr];
			}

		size[v]++;
	}

	// _________________________TEMPLATE_____________________________________________________________

	// public static long lcm(long x, long y) {
	//
	// return (x * y) / gcd(x, y);
	// }
	//
	// private static long gcd(long x, long y) {
	// if (x == 0)
	// return y;
	//
	// return gcd(y % x, x);
	// }

	//
	// static class comp implements Comparator<Integer> {
	//
	// @Override
	// public int compare(Integer p1, Integer p2) {
	//
	// return p2 - p1;
	//
	// }
	// }
	//
	// }
	//
	// public static long pow(long a, long b) {
	//
	// if (b < 0)
	// return 0;
	// if (b == 0 || b == 1)
	// return (long) Math.pow(a, b);
	//
	// if (b % 2 == 0) {
	//
	// long ret = pow(a, b / 2);
	// ret = (ret % mod * ret % mod) % mod;
	// return ret;
	// }
	//
	// else {
	// return ((pow(a, b - 1) % mod) * a % mod) % mod;
	// }
	// }

	private static class pair implements Comparable<pair> {

		long a, b, c;
		long min = Integer.MAX_VALUE;

		pair(long x, long y, long z) {
			a = x;
			b = y;
			c = z;
		}

		@Override
		public int compareTo(pair o) {

			return 1;

		}

		// @Override
		//
		// public int hashCode() {
		// return i;
		// }
		//
		// @Override
		//
		// public boolean equals(Object o) {
		//
		// pair p = (pair) o;
		// return this.i == p.i;
		// }

	}

	private static class pair1 {

		int a, b;

		pair1(int a, int b) {
			this.a = a;
			this.b = b;
		}
	}

	private static String reverse(String s) {

		return new StringBuilder(s).reverse().toString();
	}

	public static class Reader {
		final private int BUFFER_SIZE = 1 << 16;
		private DataInputStream din;
		private byte[] buffer;
		private int bufferPointer, bytesRead;

		public Reader() {
			din = new DataInputStream(System.in);
			buffer = new byte[BUFFER_SIZE];
			bufferPointer = bytesRead = 0;
		}

		public Reader(String file_name) throws IOException {
			din = new DataInputStream(new FileInputStream(file_name));
			buffer = new byte[BUFFER_SIZE];
			bufferPointer = bytesRead = 0;
		}

		public String readLine() throws IOException {
			byte[] buf = new byte[1000000 + 1]; // line length
			int cnt = 0, c;
			while ((c = read()) != -1) {
				if (c == '\n')
					break;
				buf[cnt++] = (byte) c;
			}
			return new String(buf, 0, cnt);
		}

		public int nextInt() throws IOException {
			int ret = 0;
			byte c = read();
			while (c <= ' ')
				c = read();
			boolean neg = (c == '-');
			if (neg)
				c = read();
			do {
				ret = ret * 10 + c - '0';
			} while ((c = read()) >= '0' && c <= '9');

			if (neg)
				return -ret;
			return ret;
		}

		public long nextLong() throws IOException {
			long ret = 0;
			byte c = read();
			while (c <= ' ')
				c = read();
			boolean neg = (c == '-');
			if (neg)
				c = read();
			do {
				ret = ret * 10 + c - '0';
			} while ((c = read()) >= '0' && c <= '9');
			if (neg)
				return -ret;
			return ret;
		}

		public double nextDouble() throws IOException {
			double ret = 0, div = 1;
			byte c = read();
			while (c <= ' ')
				c = read();
			boolean neg = (c == '-');
			if (neg)
				c = read();

			do {
				ret = ret * 10 + c - '0';
			} while ((c = read()) >= '0' && c <= '9');

			if (c == '.') {
				while ((c = read()) >= '0' && c <= '9') {
					ret += (c - '0') / (div *= 10);
				}
			}

			if (neg)
				return -ret;
			return ret;
		}

		private void fillBuffer() throws IOException {
			bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
			if (bytesRead == -1)
				buffer[0] = -1;
		}

		private byte read() throws IOException {
			if (bufferPointer == bytesRead)
				fillBuffer();
			return buffer[bufferPointer++];
		}

		public void close() throws IOException {
			if (din == null)
				return;
			din.close();
		}

		public int[] nextIntArray(int n) throws IOException {
			int[] arr = new int[n];
			for (int i = 0; i < n; i++) {
				arr[i] = nextInt();
			}
			return arr;
		}

		public long[] nextLongArray(int n) throws IOException {
			long[] arr = new long[n];
			for (int i = 0; i < n; i++) {
				arr[i] = nextLong();
			}
			return arr;
		}

		public int[][] nextInt2DArray(int m, int n) throws IOException {
			int[][] arr = new int[m][n];
			for (int i = 0; i < m; i++) {
				for (int j = 0; j < n; j++)
					arr[i][j] = nextInt();
			}
			return arr;
		}

		public long[][] nextInt2DArrayL(int m, int n) throws IOException {
			long[][] arr = new long[m][n];
			for (int i = 0; i < m; i++) {
				for (int j = 0; j < n; j++)
					arr[i][j] = nextInt();
			}
			return arr;
		}
		// kickstart - Solution
		// atcoder - Main
	}

}
