#include <bits/stdc++.h>
#define N 200011
using namespace std;
int n,l[N],r[N],lc[N*2],rc[N*2],nd,q,ans[N],rt;
struct edge{int v,w,next;edge(){}edge(int _v,int _w,int _next){v=_v;w=_w;next=_next;}}e[N*30];int head[N*4],sz;
void init(){memset(head,-1,sizeof(head));sz=0;}void insert(int u,int v,int w){e[++sz]=edge(v,w,head[u]);head[u]=sz;}
void build(int l,int r,int &x)
{
	if(l==r){x=l;return;}
	if(!x)x=++nd;build(l,l+r>>1,lc[x]);build((l+r>>1)+1,r,rc[x]);insert(lc[x],x,0);insert(rc[x],x,0);
}
void adde(int l,int r,int v,int w,int L,int R,int x)
{
	if(l<=L&&R<=r){insert(x,v,w);return;}
	if(l<=L+R>>1)adde(l,r,v,w,L,L+R>>1,lc[x]);if(r>L+R>>1)adde(l,r,v,w,(L+R>>1)+1,R,rc[x]);
}
struct node{int v,d;node(){}node(int _v,int _d){v=_v;d=_d;}};
bool operator<(node a,node b){return a.d>b.d;}
bool vis[N];int disa[N],disb[N];
void dijk(int s,int *dis)
{
	priority_queue<node> pq;pq.push(node(s,0));
	for(int i=1;i<=nd;++i)vis[i]=0,dis[i]=1e9;dis[s]=0;
	while(!pq.empty())
	{
		int p=pq.top().v;pq.pop();if(vis[p])continue;vis[p]=1;
		for(int i=head[p];~i;i=e[i].next)if(dis[e[i].v]>dis[p]+e[i].w)
		{
			dis[e[i].v]=dis[p]+e[i].w;pq.push(node(e[i].v,dis[e[i].v]));
		}
	}
}
int main()
{
	scanf("%d",&n);init();for(int i=1;i<=n;++i)scanf("%d%d",l+i,r+i);
	nd=n+3;build(1,n,rt);
	for(int i=1;i<=n;++i)
	{
		if(l[i]==1)insert(n+1,i,0);if(r[i]==n)insert(n+2,i,0);
		adde(l[i],r[i],i,1,1,n,rt);
	}
	dijk(n+1,disa);dijk(n+2,disb);
	for(int i=1;i<=n;++i)insert(n+3,i,min(disa[i]+disb[i],1000000000));
	dijk(n+3,ans);
	scanf("%d",&q);while(q--)
	{
		int x;scanf("%d",&x);if(ans[x]>n)printf("-1\n");else printf("%d\n",ans[x]+1);
	}return 0;
}