#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <sstream>
#include <cmath>
#include <set>
#include <iomanip>
#include <deque>
#include <stdio.h>
using namespace std;

#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define RREP(i,n) for(int (i)=(int)(n)-1;i>=0;i--)
#define REMOVE(Itr,n) (Itr).erase(remove((Itr).begin(),(Itr).end(),n),(Itr).end())
#define PB_VEC(Itr1,Itr2) (Itr1).insert((Itr1).end(),(Itr2).begin(),(Itr2).end())
#define UNIQUE(Itr) sort((Itr).begin(),(Itr).end()); (Itr).erase(unique((Itr).begin(),(Itr).end()),(Itr).end())
#define LBOUND(Itr,val) lower_bound((Itr).begin(),(Itr).end(),(val))
#define UBOUND(Itr,val) upper_bound((Itr).begin(),(Itr).end(),(val))
typedef long long ll;

vector<int> G[100010];
int A1[100010],A2[100010];
bool high_low1[100010];
bool high_low2[100010];
bool used[100010];

void dfs1(int v, bool hl){
    if(used[v])return;
    used[v]=true;
    high_low1[v]=hl;
    REP(i,G[v].size()){
        if(A1[v]==-1){
            A1[G[v][i]]=-1;
            dfs1(G[v][i],!hl);
        }else if(hl){
            if(A1[v]>A1[G[v][i]]){
                dfs1(G[v][i],!hl);
            }else{
                A1[G[v][i]]=-1;
                dfs1(G[v][i],!hl);
            }
        }else{
            if(A1[v]<A1[G[v][i]]){
                dfs1(G[v][i],!hl);
            }else{
                A1[G[v][i]]=-1;
                dfs1(G[v][i],!hl);
            }
        }
    }
}

void dfs2(int v, bool hl){
    if(used[v])return;
    used[v]=true;
    high_low2[v]=hl;
    REP(i,G[v].size()){
        if(A2[v]==-1){
            A2[G[v][i]]=-1;
            dfs2(G[v][i],!hl);
        }else if(hl){
            if(A2[v]>A2[G[v][i]]){
                dfs2(G[v][i],!hl);
            }else{
                A2[G[v][i]]=-1;
                dfs2(G[v][i],!hl);
            }
        }else{
            if(A2[v]<A2[G[v][i]]){
                dfs2(G[v][i],!hl);
            }else{
                A2[G[v][i]]=-1;
                dfs2(G[v][i],!hl);
            }
        }
    }
}

int main(){
    
    int n; cin>>n;
    REP(i,n)cin>>A1[i];
    REP(i,n)A2[i]=A1[i];
    REP(i,n-1){
        int a,b; cin>>a>>b;
        G[a].push_back(b);
        G[b].push_back(a);
    }
    
    REP(i,100010)used[i]=false;
    dfs1(1,true);
    REP(i,100010)used[i]=false;
    dfs2(1,true);
    
    int q; cin>>q;
    REP(i,q){
        bool flag1=true,flag2=true;
        int u,v; cin>>u>>v;
        if(A1[u]<0||A1[v]<0)flag1=false;
        else if(high_low1[u]==high_low1[v])flag1=false;
        if(A2[u]<0||A2[v]<0)flag2=false;
        else if(high_low2[u]==high_low2[v])flag2=false;
        if(flag1||flag2)cout<<"YES"<<endl;
        else cout<<"NO"<<endl;
    }
    
    
    return 0;
}