#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
const int maxn=100001;
const int maxm=20;
int a[maxn][maxm],b[maxn][maxm],fa[maxn],n;
int findfa(int v)
{
	if(fa[v]!=v)fa[v]=findfa(fa[v]);
	return fa[v];
}
void init()
{
	memcpy(b,a,sizeof(a));
    for(int j=1;(1<<j)<=n;j++)
	  for(int i=1;i+(1<<j)-1<=n;i++)
	  {
		a[i][j]=min(a[i+(1<<(j-1))][j-1],a[i][j-1]);
		b[i][j]=max(b[i+(1<<(j-1))][j-1],b[i][j-1]);
	  }
}
void jianbian(int l,int r)
{
	int k=0,v,u;
	while((1<<(k+1))<=r-l+1) k++;
	v=max(b[l][k],b[r-(1<<k)+1][k]);
	u=min(a[l][k],a[r-(1<<k)+1][k]);
	fa[findfa(v)]=findfa(u);
}
int main()
{
	freopen("basicgraph.in","r",stdin);
	freopen("basicgraph.out","w",stdout);
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
	{
	  scanf("%d",&a[i][0]);
	  fa[a[i][0]]=a[i][0];
	}
	init();
	scanf("%d",&n);
	int v,u;
	for(int i=1;i<=n;i++)
	{
	  scanf("%d%d",&v,&u);
	  jianbian(v,u);
	}
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
	{
	  scanf("%d%d",&v,&u);
	  if(findfa(v)==findfa(u))printf("YES\n");
	  else printf("NO\n");
	}
	return 0;
}