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

public class D {

	static int n;
	static int log = 22;
	static int[] level, up[];
	static ArrayList<Integer>[] adj;

	static int lca(int u, int v) {

		if (level[u] < level[v])
			return lca(v, u);
		for (int i = log - 1; i >= 0; i--) {
			int u2 = up[u][i];
			if (level[u2] >= level[v])
				u = u2;
		}
		if (u == v)
			return u;
		for (int i = log - 1; i >= 0; i--) {
			int u2 = up[u][i], v2 = up[v][i];
			if (u2 != v2) {
				u = u2;
				v = v2;
			}
		}
		return up[u][0];
	}

	static int dist(int u, int v) {
		return level[u] + level[v] - 2 * level[lca(u, v)];
	}

	static void dfs(int u, int p) {

		up[u][0] = p;
		for (int i = 1; i < log; i++)
			up[u][i] = up[up[u][i - 1]][i - 1];
		for (int v : adj[u])
			if (v != p) {
				level[v] = level[u] + 1;
				dfs(v, u);
			}

	}

	static boolean can(int from, int to, int k) {
		if (k < 0)
			return false;
		int dis = dist(from, to);
		return dis <= k && dis % 2 == k % 2;
	}

	public static void main(String[] args) throws IOException {
		Scanner sc = new Scanner();
		PrintWriter out = new PrintWriter(System.out);
		n = sc.nextInt();
		adj = new ArrayList[n];
		for (int i = 0; i < n; i++)
			adj[i] = new ArrayList();
		up = new int[n][log];
		level = new int[n];
		for (int i = 1; i < n; i++) {
			int u = sc.nextInt() - 1, v = sc.nextInt() - 1;
			adj[u].add(v);
			adj[v].add(u);
		}
		dfs(0, 0);
		int q = sc.nextInt();
		while (q-- > 0) {
			int x = sc.nextInt() - 1, y = sc.nextInt() - 1, a = sc.nextInt() - 1, b = sc.nextInt() - 1,
					k = sc.nextInt();
			// no edge used
			boolean ans = false;
			ans |= can(a, b, k);
			// go to x then y then b
			int axy = dist(a, x) + 1;
			ans |= can(y, b, k - axy);
			// go to y then x then b
			int ayx = dist(a, y) + 1;
			ans |= can(x, b, k - ayx);
			out.println(ans ? "YES" : "NO");
		}
		out.close();

	}

	static class Scanner {
		BufferedReader br;
		StringTokenizer st;

		Scanner() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}

		Scanner(String fileName) throws FileNotFoundException {
			br = new BufferedReader(new FileReader(fileName));
		}

		String next() throws IOException {
			while (st == null || !st.hasMoreTokens())
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}

		String nextLine() throws IOException {
			return br.readLine();
		}

		int nextInt() throws IOException {
			return Integer.parseInt(next());
		}

		long nextLong() throws NumberFormatException, IOException {
			return Long.parseLong(next());
		}

		double nextDouble() throws NumberFormatException, IOException {
			return Double.parseDouble(next());
		}

		boolean ready() throws IOException {
			return br.ready();
		}

	}

	static void sort(int[] a) {
		shuffle(a);
		Arrays.sort(a);
	}

	static void shuffle(int[] a) {
		int n = a.length;
		Random rand = new Random();
		for (int i = 0; i < n; i++) {
			int tmpIdx = rand.nextInt(n);
			int tmp = a[i];
			a[i] = a[tmpIdx];
			a[tmpIdx] = tmp;
		}
	}

}