#include<iostream>
#include<cstring>
#include<cstdio>
#include<stack>
#include<queue>
using namespace std;
const int maxv=210;
const int maxe=210*210;
const int INF=0x3f3f3f3f;
int cnt;
int lev[maxv],dis[maxv],head[maxv];
struct Edge {
int to,val,next;
} edge[maxe];
template <class T>
inline bool scan_d(T &ret) {
char c;
int sgn;
if(c=getchar(),c==EOF)
return 0;
while(c!=' - '&&(c<'0'||c>'9'))
c=getchar();
sgn=(c==' - '?-1:1);
ret=(c==' - ')?0:(c-'0');
while(c=getchar(),c>='0'&&c<='9')
ret=ret*10+(c-'0');
ret*=sgn;
return 1;
}
void init() {
memset(head,-1,sizeof head);
cnt=0;
}
void addedge(int from,int to,int val) {
edge[cnt].to=to;
edge[cnt].val=val;
edge[cnt].next=head[from];
head[from]=cnt++;
}
bool spfa(int s,int n) {//玄学stack写法
stack<int> q;
bool inq[maxv];
int visit[maxv];
for(int i=1; i<=n; i++)
dis[i]=INF,inq[i]=false,visit[i]=0;
dis[s]=0,q.push(s),inq[s]=true;
while(!q.empty()) {
int temp=q.top();
q.pop();
inq[temp]=false;
for(int i=head[temp]; i!=-1; i=edge[i].next) {
if(dis[edge[i].to]>dis[temp]+edge[i].val) {
dis[edge[i].to]=dis[temp]+edge[i].val;
if(!inq[edge[i].to]) {
if(++visit[edge[i].to]>=n)
dis[edge[i].to]=-INF;//如果允许负权回路,就不要return
if(visit[edge[i].to]<=n)
q.push(edge[i].to);
inq[edge[i].to]=true;
}
}
}
}
return true;
}
int main(void) {
#ifndef ONLINE_JUDGE
freopen("E:\\input.txt","r",stdin);
#endif // ONLINE_JUDGE
int T,n,m,ta,tb,tc,q,ans,kase=1,temp;
scanf("%d",&T);
while(T--) {
init();
scan_d<int>(n);
for(int i=1; i<=n; i++)
scan_d<int>(lev[i]);
scan_d<int>(m);
for(int i=1; i<=m; i++) {
scan_d<int>(ta);
scan_d<int>(tb);
tc=lev[tb]-lev[ta];
tc=tc*tc*tc;
addedge(ta,tb,tc);
}
scan_d<int>(q);
spfa(1,n);
printf("Case %d:\n",kase++);
while(q--) {
scan_d<int>(temp);
if(dis[temp]<3||dis[temp]==INF)
puts("?");
else
printf("%d\n",dis[temp]);
}
}
return 0;
}