/*
  Name: 基本的图问题
  Copyright: 
  Author: chairman
  Date: 12/09/16 10:26
  Description: st维护最大最小，并查集判断能否到达 
*/
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<cstring>
#include<cmath>
using namespace std;
int read()
{
	char ch;
	int x,f=1;
	while(ch=getchar(),!isdigit(ch))if(ch=='-')f=-1;
	x=ch-48;
	while(ch=getchar(),isdigit(ch))x=x*10+ch-48;
	return x*f;
}
void write(int x)
{
	if(x<0)putchar('-'),x=-x;
	int cnt=0;char ch[50];
	while(ch[++cnt]=x%10+48,x/=10);
	while(putchar(ch[cnt]),--cnt);
	putchar('\n');
}
int n,ma[110000][30],mi[110000][30],rt[110000];
void ST()
{
	int m=log(n*1.0)/log(2.0);
	for(int j=1;j<=m;j++)
	{
		for(int i=1;i<=n;i++)
		{
			int k=1<<(j-1);
			ma[i][j]=ma[i][j-1];mi[i][j]=mi[i][j-1];
			if(i+k<=n)ma[i][j]=max(ma[i][j],ma[i+k][j-1]),mi[i][j]=min(mi[i][j],mi[i+k][j-1]);
		}
	}
}
int qmin(int x,int y)
{
	int m=log((y-x+1)*1.0)/log(2.0);
	int k=1<<m;
	return min(mi[x][m],mi[y-k+1][m]);
}
int qmax(int x,int y)
{
	int m=log((y-x+1)*1.0)/log(2.0);
	int k=1<<m;
	return max(ma[x][m],ma[y-k+1][m]);
}
int find(int x)
{
	int xx=x,y;
	while(rt[xx]!=xx)xx=rt[xx];
	while(rt[x]!=xx)y=rt[x],rt[x]=xx,x=y;
	return xx;
}
int main()
{
	freopen("basicgraph.in","r",stdin);
	freopen("basicgraph.out","w",stdout);
	n=read();
	for(int i=1;i<=n;i++)ma[i][0]=mi[i][0]=read();
	for(int i=1;i<=n;i++)rt[i]=i;
	ST();
	int m=read();
	for(int i=1;i<=m;i++)
	{
		int x=read(),y=read();
		int fx=find(qmin(x,y)),fy=find(qmax(x,y));//注意要find 
		rt[fx]=fy;
	}
	int q=read();
	for(int i=1;i<=q;i++)
	{
		int x=read(),y=read();
		int fx=find(x),fy=find(y);
		if(fx==fy)puts("YES");
		else puts("NO");
	}
}