#include<iostream>

 #include<cstdio>

 #include<cstring>

 #include<cmath>

 #include<algorithm>

 #include<vector>

 using namespace std;

 const int N=;

 const int D=;

 struct node{

     int a,b;

 };

 vector<int> road[N],h[N];

 vector<node> q[N];

 int n,m,t,fa[N][D+],w[N][D+],head[N],sum[N],ans[N],g[N];

 int cnt,tot,dep[N],id[N],size[N],c[N];

 int lowbit(int x){

     return x&-x;

 }

 void update(int x){

     for(int i=x;i<=n;i+=lowbit(i)){

         c[i]+=;

     }

 }

 int check(int x){

     int tmp=;

     for(int i=x;i>=;i-=lowbit(i)){

         tmp+=c[i];

     }

     return tmp;

 }

 struct edge{

     int to,nxt;

 }e[N*];

 void add(int u,int v){

     cnt++;

     e[cnt].nxt=head[u];

     e[cnt].to=v;

     head[u]=cnt;

 }

 void dfs1(int u,int deep){

     dep[u]=deep;

     id[u]=++tot;

     size[u]=;

     for(int i=head[u];i;i=e[i].nxt){

         int v=e[i].to;

         if(v==fa[u][])continue;

         dfs1(v,deep+);

         size[u]+=size[v];

     }

 }

 void dfs2(int u){

     g[u]=u;

 //    cout<<u<<"ksdjfksdf"<<endl;

     for(int i=;i<h[u].size();i++){

     //    cout<<h[u][i]<<endl;

         if(dep[h[u][i]]<dep[g[u]])g[u]=h[u][i];

     }

     for(int i=head[u];i;i=e[i].nxt){

         int v=e[i].to;

     //    cout<<v<<" "<<fa[u][0]<<endl;

         if(v==fa[u][])continue;

         dfs2(v);

         if(dep[g[v]]<dep[g[u]])g[u]=g[v];

     }

     w[u][]=g[u];

 }

 int lca(int x,int y){

     if(dep[x]<dep[y])swap(x,y);

     for(int i=D;i>=;i--){

         if(dep[fa[x][i]]>=dep[y])x=fa[x][i];

     }

     if(x==y)return x;

     for(int i=D;i>=;i--){

         if(fa[x][i]!=fa[y][i])x=fa[x][i],y=fa[y][i];

     }

     return fa[x][];

 }

 node work(int x,int LCA){

     if(x==LCA)return (node){x,};

     int tmp=;

     for(int i=D;i>=;i--)

         if(dep[w[x][i]]>dep[LCA])x=w[x][i],tmp+=(<<i);

     if(w[x][]==x)return (node){x,-};

     return (node){x,tmp};

 }

 int main(){

     scanf("%d",&n);

     for(int i=;i<=n;i++){

         scanf("%d",&fa[i][]);

         add(fa[i][],i);

         add(i,fa[i][]);

     }

     dfs1(,);

     for(int i=;i<=D;i++)

         for(int j=;j<=n;j++){

             fa[j][i]=fa[fa[j][i-]][i-];

         }

     scanf("%d",&m);

     for(int i=;i<=m;i++){

         int x,y;

         scanf("%d%d",&x,&y);

         int c=lca(x,y);

     //    cout<<c<<endl;

         if(id[x]>id[y])swap(x,y);

         road[id[x]].push_back(id[y]);

         if(dep[c]<dep[x])h[x].push_back(c);

         if(dep[c]<dep[y])h[y].push_back(c);

     }

     dfs2();

     for(int i=;i<=n;i++){

 //        cout<<g[i]<<endl;

     }

     for(int i=;i<=D;i++)

         for(int j=;j<=n;j++){

             w[j][i]=w[w[j][i-]][i-];

     //        cout<<w[j][i]<<endl;

         }

     scanf("%d",&t);

     for(int i=;i<=t;i++){

         int x,y;

         scanf("%d%d",&x,&y);

         int c=lca(x,y);

         node A=work(x,c);

         node B=work(y,c);

         if(A.b==-||B.b==-){

             ans[i]=-;

             continue;

         }

         if(x==c||y==c){

             ans[i]=A.b+B.b+;

             continue;

         }

         ans[i]=A.b+B.b+;

         x=A.a;

         y=B.a;

         if(id[x]>id[y])swap(x,y);

         q[id[x]-].push_back((node){y,-i});

         q[id[x]+size[x]-].push_back((node){y,i});

     }

     for(int i=;i<=n;i++){

         for(int j=;j<road[i].size();j++)update(road[i][j]);

         for(int j=;j<q[i].size();j++){

             int num=(q[i][j].b>?:-);

             int x=q[i][j].a;int y=q[i][j].b*num;

             sum[y]+=num*(check(id[x]+size[x]-)-check(id[x]-));

         }

     }

     for(int i=;i<=t;i++){

         printf("%d\n",ans[i]-(sum[i]>));

     }

     return ;

 }