/*
If you want to aim high, aim high
Don't let that studying and grades consume you
Just live life young
*/
import java.io.*;
import java.util.*;

   public class x1304E
   {
   	static int[] p;
   	static int[] depth;
   	static int[][] anc;
   	static int[] amt;
   	static LinkedList<Integer>[] edges;
   	static LinkedList<Integer> revOrder;
      
   	public static void main(String[] args) throws IOException 
      {
   		BufferedReader infile = new BufferedReader(new InputStreamReader(System.in));  
   		StringTokenizer st;
         int T = 1;
         for(int qw=0; qw < T; qw++)
         {
      		st = new StringTokenizer(infile.readLine());
            int N = Integer.parseInt(st.nextToken());
      		p = new int[N+1];
      		amt = new int[N+1];
      		depth = new int[N+1];
      		Arrays.fill(p, -1);
      		p[0] = p[1] = 0;
      		anc = new int[N+1][20];
      		edges = new LinkedList[N+1];
      		revOrder = new LinkedList<Integer>();
      		for(int i = 0; i < edges.length; i++)
      			edges[i] = new LinkedList<Integer>();
      		for(int a = 1; a < N; a++)
            {
      			st = new StringTokenizer(infile.readLine());
      			int x = Integer.parseInt(st.nextToken());
      			int y = Integer.parseInt(st.nextToken());
      			edges[x].add(y);
      			edges[y].add(x);
            }
      		bfs();
      		genLCA();
            //new stuff
            int Q = Integer.parseInt(infile.readLine());
            int[] root_distance = new int[N+1];
            dfs(1, root_distance, new boolean[N+1], edges);
            //query
            StringBuilder sb = new StringBuilder();
      		for(int i = 0; i < Q; i++) 
            {
      			st = new StringTokenizer(infile.readLine());
      			int x = Integer.parseInt(st.nextToken());
               int y = Integer.parseInt(st.nextToken());
      			int a = Integer.parseInt(st.nextToken());
               int b = Integer.parseInt(st.nextToken());
               int k = Integer.parseInt(st.nextToken());
               String res = "NO";
      			int lca = lca(a, b);
      			int length = root_distance[a]+root_distance[b]-2*root_distance[lca];
               if(length <= k && length%2 == k%2)
                  res = "YES";
               int lca2 = lca(a,x);
               int len2a = root_distance[a]+root_distance[x]-2*root_distance[lca2];
               lca2 = lca(b,y);
               len2a += root_distance[b]+root_distance[y]-2*root_distance[lca2]+1;
               if(len2a <= k && len2a%2 == k%2)
                  res = "YES";
               lca2 = lca(a,y);
               len2a = root_distance[a]+root_distance[y]-2*root_distance[lca2];
               lca2 = lca(b,x);
               len2a += root_distance[b]+root_distance[x]-2*root_distance[lca2]+1;
               if(len2a <= k && len2a%2 == k%2)
                  res = "YES";
               sb.append(res+"\n");
      		}
            System.out.print(sb.toString());
      		//end
         }
   	}
      public static int dfs(int curr, int[] dist, boolean[] seen, LinkedList<Integer>[] edges)
      {
         if(seen[curr])
            return 0;
         seen[curr] = true;
         for(int next: edges[curr])
            if(!seen[next])
            {
               dist[next] = dist[curr]+1;
               dfs(next, dist, seen, edges);
            }
         return dist[curr];
      }
   	public static void compute() 
      {
   		while(!revOrder.isEmpty()) 
         {
   			int curr = revOrder.removeFirst();
   			amt[p[curr]] += amt[curr];
   		}
   	}
   	public static int lca(int a, int b) 
      {
   		if(depth[a] > depth[b])
   			return lca(b, a);
   		if(depth[a] < depth[b])
   			b = getP(b, depth[a]);
   		for(int k = 19; k > 0; k--)
   			while(anc[a][k] != anc[b][k]) 
            {
   				a = anc[a][k];
   				b = anc[b][k];
   			}
   		while(a != b) 
         {
   			a = p[a];
   			b = p[b];
   		}
   		return a;
   	}
   	public static int getP(int curr, int wantedD) 
      {
   		for(int k = 19; depth[curr] != wantedD; k--)
   			while(depth[curr] - (1<<k) >= wantedD)
   				curr = anc[curr][k];
   		return curr;
   	}
   	public static void genLCA() 
      {
   		for(int i = 1; i < p.length; i++)
   			anc[i][0] = p[i];
   		for(int j = 1; j < anc[0].length; j++) 
   			for(int i = 1; i < p.length; i++) 
   				anc[i][j] = anc[anc[i][j-1]][j-1];
   	}
   	public static void bfs() 
      {
   		LinkedList<Integer> q = new LinkedList<Integer>();
   		q.add(1);
   		while(!q.isEmpty()) 
         {
   			int curr = q.removeFirst();
   			revOrder.addFirst(curr);
   			for(int child: edges[curr])
   				if(p[child] == -1) 
               {
   					p[child] = curr;
   					depth[child] = 1 + depth[curr];
   					q.add(child);
   				}
   		}
   	}
   }