#include "garden.h"
#include "gardenlib.h"
#include <bits/stdc++.h>
using namespace std;
pair <int, int> edge[150001];
int op,mx[150001],mx2[150001],nxt[300001],ch[300001],t[300001],id,cycle[300001],d[300001],cnt[300001],res,idx[300001],pos[300001];
vector <int> ke[300001],ve[300001],tmp;
void dfs(int u){
for (int v:ke[u]){
d[v]=d[u]+1;
dfs(v);
}
}
void dfs2(int u, int val){
op++;
if (u%2==0&&d[u]==val){
ch[u]=1;
return;
}
for (int v:ke[u])
dfs2(v,val);
}
void count_routes(int N, int M, int P, int R[][2], int Q, int G[]){
for (int i=0;i<M;i++)
edge[M-i-1]={R[i][0],R[i][1]};
memset(mx,-1,sizeof(mx));
memset(mx2,-1,sizeof(mx2));
for (int i=0;i<M;i++){
auto [u,v]=edge[i];
if (mx[u]%M<i%M){
mx2[u]=mx[u];
mx[u]=i;
}
else if (mx2[u]%M<i%M)
mx2[u]=i;
if (mx[v]%M<i%M){
mx2[v]=mx[v];
mx[v]=i;
}
else if (mx2[v]%M<i%M)
mx2[v]=i;
}
for (int i=0;i<N;i++){
int v=edge[mx[i]].first^edge[mx[i]].second^i;
nxt[i*2]=v*2+1-(mx[i]!=mx[v]||mx2[v]==-1);
if (mx2[i]==-1)
continue;
v=edge[mx2[i]].first^edge[mx2[i]].second^i;
nxt[i*2+1]=v*2+1-(mx2[i]!=mx[v]||mx2[v]==-1);
}
t[P*2]=t[P*2+1]=1;
for (int i=0;i<N*2;i++){
if (i%2==1&&mx2[i/2]==-1)
continue;
if (!ch[i]){
tmp.clear();
tmp.push_back(i);
int u=i;
while (true){
u=nxt[u];
if (ch[u]>1){
for (int j:tmp){
idx[j]=idx[u];
pos[j]=pos[u];
ch[j]=2;
}
break;
}
if (ch[u]==1){
int p=0;
for (int j=0;j<tmp.size();j++)
if (tmp[j]==u)
p=j;
for (int j=p;j<tmp.size();j++){
ve[id].push_back(tmp[j]);
cycle[tmp[j]]=1;
pos[tmp[j]]=j-p;
}
for (int j:tmp){
idx[j]=id;
ch[j]=2;
}
id++;
break;
}
tmp.push_back(u);
ch[u]=1;
}
}
}
for (int i=0;i<N*2;i++){
if (i%2==1&&mx2[i/2]==-1)
continue;
if (!cycle[i])
ke[nxt[i]].push_back(i);
}
tmp.clear();
for (int i=0;i<id;i++)
for (int j:ve[i])
dfs(j);
memset(ch,0,sizeof(ch));
for (int i=0;i<Q;i++){
res=0;
dfs2(P*2,d[P*2]+G[i]);
dfs2(P*2+1,d[P*2+1]+G[i]);
for (int j=0;j<N*2;j+=2){
if (!ch[j]&&d[j]<G[i]){
int v=ve[idx[j]][(pos[j]+G[i]-d[j])%ve[idx[j]].size()];
ch[j]=(v==P*2||v==P*2+1);
}
res+=ch[j];
ch[j]=0;
}
answer(res);
}
}
