#include<bITs/stdc++.h>
using namespace std;
tyPEdef long long ll;
const int maxn=1e5+5;
int n,k;
int fa[maxn],minn[maxn],maxx[maxn],eg[maxn];
int find(int x)
{
    if(fa[x]==x) return x;
    return fa[x]=find(fa[x]);
}
struct line
{
    int l,r;
}area[maxn];
bool cmp(line a,line b)
{
    return a.l<b.l;
}
int rlim[maxn];
int main()
{
    freopen("yy.in","r",stdin);
    freopen("yy.out","w",stdout);
    scanf("%d%d",&amp;n,&k);
    for(int i=1;i<=n;i++) fa[i]=minn[i]=maxx[i]=i;
    for(int i=1;i<=k;i++)
    {
        int x,y;
        scanf("%d%d",&x,&y);
        int fx=find(x),fy=find(y);
        if(fx!=fy)
        {  
            minn[fx]=min(minn[fx],minn[fy]);
            maxx[fx]=max(maxx[fx],maxx[fy]);
            eg[fx]+=eg[fy]+1;
            fa[fy]=fx;
        }
        else eg[fx]++;
    }
    int cnt=0;
    for(int i=1;i<=n;i++)
    {
        int fi=find(i);
        if(i==fi && eg[i]<=maxx[i]-minn[i]) 
        {
            area[++cnt].r=maxx[i]; area[cnt].l=minn[i];
        }
    }
    sort(area+1,area+cnt+1,cmp);
    int rpos=n;
    for(int i=n;i>=1;i--)
    {
        while(cnt && area[cnt].l==i)
        {
            rpos=min(rpos,area[cnt].r-1);
            cnt--;
        }
        rlim[i]=rpos;
    }
    int q;
    scanf("%d",&q);
    int x,y;
    for(int i=1;i<=q;i++)
    {
        scanf("%d%d",&x,&y);
        if(y>rlim[x]) PRintf("Non");
        else printf("Yesn");
    }
    return 0;
}