#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <functional>
#include <set>
#include <ctime>
#include <random>
#include <chrono>
#include <cassert>
using namespace std;

namespace {
	using Integer = long long; //__int128;
	template<class T> istream& operator >> (istream& is, vector<T>& vec){for(T& val: vec) is >> val; return is;}
	template<class T> istream& operator ,  (istream& is, T& val){ return is >> val;}
	template<class T> ostream& operator << (ostream& os, const vector<T>& vec){for(int i=0; i<vec.size(); i++) os << vec[i] << (i==vec.size()-1?"":" "); return os;}
	template<class T> ostream& operator ,  (ostream& os, const T& val){ return os << " " << val;}

	template<class H> void print(const H& head){ cout << head; }
	template<class H, class ... T> void print(const H& head, const T& ... tail){ cout << head << " "; print(tail...); }
	template<class ... T> void println(const T& ... values){ print(values...); cout << endl; }

	template<class H> void eprint(const H& head){ cerr << head; }
	template<class H, class ... T> void eprint(const H& head, const T& ... tail){ cerr << head << " "; eprint(tail...); }
	template<class ... T> void eprintln(const T& ... values){ eprint(values...); cerr << endl; }

	string operator "" _s (const char* str, size_t size){ return move(string(str)); }
	constexpr Integer my_pow(Integer x, Integer k, Integer z=1){return k==0 ? z : k==1 ? z*x : (k&1) ? my_pow(x*x,k>>1,z*x) : my_pow(x*x,k>>1,z);}
	constexpr Integer my_pow_mod(Integer x, Integer k, Integer M, Integer z=1){return k==0 ? z%M : k==1 ? z*x%M : (k&1) ? my_pow_mod(x*x%M,k>>1,M,z*x%M) : my_pow_mod(x*x%M,k>>1,M,z);}
	constexpr unsigned long long operator "" _ten (unsigned long long value){ return my_pow(10,value); }

	inline int k_bit(Integer x, int k){return (x>>k)&1;} //0-indexed

	mt19937 mt(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count());

	template<class T> string join(const vector<T>& v, const string& sep){
		stringstream ss; for(int i=0; i<v.size(); i++){ if(i>0) ss << sep; ss << v[i]; } return ss.str();
	}
}

void dfs1(vector<vector<int>>& G, vector<vector<int>>& p, vector<int>& d, int pos, int last){
	p[pos][0] = last;
	d[pos] = d[last]+1;
	for(auto& next : G[pos]){
		if(next == last) continue;
		dfs1(G,p,d, next,pos);
	}
}

int dfs2(vector<vector<int>>& par, vector<int>& kado, vector<int>& max_kado, int pos){
	if(max_kado[pos] != -1) return max_kado[pos];
	if(kado[pos] == 0){
		return max_kado[pos] = 0;
	}
	int k = 0;
	while((1<<k) <= kado[pos]) k++;
	k--;
	return max_kado[pos] = (1<<k) | dfs2(par,kado,max_kado, par[pos][k]);
}

inline bool is_kadomatsu(int a, int b, int c){
	return (a!=c) && ((a<b&&b>c) || (a>b&&b<c));
}

inline int x_parent(vector<vector<int>>& par, int pos, int x){
	for(int k=0; x>0; k++, x>>=1){
		if(x&1){
			pos = par[pos][k];
		}
	}
	return pos;
}

int lca(vector<vector<int>>& par, vector<int>& d, int u, int v){
	if(d[u] < d[v]) swap(u,v);
	int dd = d[u] - d[v];
	u = x_parent(par, u, dd);
	if(u==v){
		return u;
	}
	for(int k=par[u].size()-1; k>=0; k--){
		if(par[u][k] != par[v][k]){
			u = par[u][k];
			v = par[v][k];
		}
	}
	return par[u][0];
}

int main(){
	int n;
	scanf("%d", &n);
	vector<int> a(n);
	for(int i=0; i<n; i++){
		scanf("%d", &a[i]);
	}
	
	vector<vector<int>> G(n);
	for(int i=0; i<n-1; i++){
		int u,v;
		scanf("%d%d", &u,&v);
		u--; v--;
		G[u].push_back(v);
		G[v].push_back(u);
	}

	int log_n = 0;
	while((1<<log_n) <= n) log_n++;

	vector<vector<int>> par(n, vector<int>(log_n));
	vector<int> depth(n,-1);
	vector<int> kado(n,0);

	dfs1(G,par,depth, 0,0);
	for(int i=0; i<n; i++){
		int p1 = par[i][0];
		int p2 = par[p1][0];
		kado[i] = is_kadomatsu(a[i],a[p1],a[p2]) ? 1 : 0;
	}
	for(int d=1; d<log_n; d++){
		for(int i=0; i<n; i++){
			par[i][d] = par[ par[i][d-1] ][ d-1 ];
			kado[i] |= ( kado[i] & kado[ par[i][d-1] ] & (1<<d-1)) << 1;
		}
	}

	vector<int> max_kado(n, -1);
	for(int i=0; i<n; i++){
		if(max_kado[i] != -1) continue;
		dfs2(par,kado,max_kado, i);
	}

	int q;
	scanf("%d", &q);
	while(q--){
		int u,v;
		scanf("%d%d", &u, &v);
		u--; v--;
		if(depth[u] < depth[v]) swap(u,v);

		int p = lca(par, depth, u,v);

		if(p == v){
			int dd = depth[u] - depth[v];
			if(dd <= 2){
				puts("NO");
				continue;
			}

			if(max_kado[u] <= dd-2){
				puts("NO");
				continue;
			}

			int qu = par[u][0];
			int pu = x_parent(par, u,dd-1);

			if(
				is_kadomatsu(a[qu], a[u], a[v]) && 
				is_kadomatsu(a[u], a[p], a[pu])
				){
				puts("YES");
			}else{
				puts("NO");
			}

		}else{

			if(max_kado[u] <= depth[u] - depth[p] - 2){
				puts("NO");
				continue;
			}

			if(max_kado[v] <= depth[v] - depth[p] - 2){
				puts("NO");
				continue;
			}

			int qu = par[u][0];
			int qv = par[v][0];
			int pu = x_parent(par, u, depth[u]-depth[p]-1);
			int pv = x_parent(par, v, depth[v]-depth[p]-1);

			if(
				is_kadomatsu(a[qu],a[u],a[v]) &&
				is_kadomatsu(a[u],a[v],a[qv]) &&
				is_kadomatsu(a[pu],a[p],a[pv])
				){
				puts("YES");
			}else{
				puts("NO");
			}
		}
	}
	return 0;
}