#include<iostream>
#include<cstdio>
#include<cstring>
#define syy myson
using namespace std;
const int maxn=100010,INF=100000;
int n,m,k,a[maxn],father[maxn],s,e,minx,maxx,u,v,i,j;
int find(int x)
{
	if(father[x]!=x)father[x]=find(father[x]);
	return father[x];
}
void unionn(int r1,int r2)
{
	father[r2]=r1;
}
int Main()
{
	freopen("basicgraph.in","r",stdin);freopen("basicgraph.out","w",stdout);
	scanf("%d",&n);
	for(i=1;i<=n;i++)
	{
		scanf("%d",&a[i]);
		father[a[i]]=a[i];
	}
	scanf("%d",&m);
	for(i=1;i<=m;i++)
	{
		scanf("%d%d",&s,&e);
		minx=INF;maxx=-INF;
		for(j=s;j<=e;j++)
		{
			if(minx>a[j])minx=a[j];
			if(maxx<a[j])maxx=a[j];
		}
		int r1=find(minx);
		int r2=find(maxx);
		if(r1!=r2)unionn(r1,r2);
	}
	scanf("%d",&k);
	for(i=1;i<=k;i++)
	{
		scanf("%d%d",&u,&v);
		if(find(u)==find(v))
		  printf("YES\n");
		else
		  printf("NO\n");
	}
	return 0;
}
int main(){;};
int syy=Main();