import java.util.Scanner;
import java.util.ArrayList;

public class Graph_Tasks {
	private int V;
	private int E;
	private ArrayList<Integer>[] graph;
	private int[][] dp;
	private int[] timeIn;
	private int[] timeOut;
	private int L;
	private int timer = 0;
	
	private Graph_Tasks(int v, int e) {
		V = v + 1;
		graph = new ArrayList[V];
		for (int i = 0; i < V; i++) {
			graph[i] = new ArrayList<Integer>();
		}
		timeIn = new int[V];
		timeOut = new int[V];
		
		L = 1;
		while ((1<<L) <= V) L++;

		dp = new int[V][L + 1];
	}
	
	private void addEdge(int v, int u) {
		graph[v].add(u);
		graph[u].add(v);
	}
	
	private void dfs(int v, int u) {
		timeIn[v] = ++timer;
		dp[v][0] = u;
		
		for (int i = 1; i <= L; i++) {
			dp[v][i] = dp[dp[v][i-1]][i-1];
		}
		
		for (int adj : graph[v]) {
			if (adj != u) {
				dfs(adj, v);
			}
		}
		
		timeOut[v] = ++timer;
	}
	
	private int lca(int v, int u) {
		if (isParent(v, u)) return v;
		if (isParent(u, v)) return u;
		
		for (int i = L; i >= 0; i--) {
			if(!isParent(dp[v][i], u)) {
				v = dp[v][i];
			}
		}
		
		return dp[v][0];
	}
	
	private boolean isParent(int v, int u) {
		return timeIn[v] <= timeIn[u] && timeOut[v]>=timeOut[u];
	}
	
	private String solve(Graph_Tasks g, int x, int y, int a, int b, int k) {
		int a_b_lca = g.lca(a, b);
		int a_x_lca = g.lca(a, x);
		int y_b_lca = g.lca(y, b);
		int a_y_lca = g.lca(a, y);
		int b_x_lca = g.lca(b, x);
		int path_1 = g.pathLength(a, a_b_lca) + g.pathLength(b, a_b_lca);
		int path_2 = g.pathLength(a, a_x_lca) + g.pathLength(x, a_x_lca) + g.pathLength(y, y_b_lca) + g.pathLength(b, y_b_lca) + 1;
		int path_3 = g.pathLength(a, a_y_lca) + g.pathLength(y, a_y_lca) + g.pathLength(b, b_x_lca) + g.pathLength(x, b_x_lca) + 1;
		
		if (k % 2 == 0) {
			if ((path_1 % 2 == 0 && path_1 <= k) || (path_2 % 2 == 0 && path_2 <= k) || (path_3 % 2 == 0 && path_3 <= k)) {
				return "YES";
			}
		} else {
			if ((path_1 % 2 != 0 && path_1 <= k) || (path_2 % 2 != 0 && path_2 <= k) || (path_3 % 2 != 0 && path_3 <= k)) {
				return "YES";
			}
		}
		
		
		return "NO";
	}
	

	private int pathLength(int v, int u) {
		int count = 0;

		while (v != u) {
			if (dp[v][0] == u) {
				count += 1;
				break;
			}
			for (int i = 0; i <= L; i++) {
				if (timeIn[u] >= timeIn[dp[v][i]]) {
					count += Math.pow(2, i-1); 
					v = dp[v][i-1];
					break;
				}
			}
		}
		return count;
	}
	

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int n = in.nextInt();
		Graph_Tasks g = new Graph_Tasks(n, n-1);

		for (int i = 0; i < n-1; i++) {
			int v = in.nextInt();
			int u = in.nextInt();
			g.addEdge(v, u);
		}
		
		g.dfs(1, 1);
		
		int q = in.nextInt();
		for (int i = 0; i < q; i++) {
			int x = in.nextInt();
			int y = in.nextInt();
			int a = in.nextInt();
			int b = in.nextInt();
			int k = in.nextInt();
			System.out.println(g.solve(g, x, y, a, b, k));
		}
		
		in.close();
	}
}
