#include <iostream>

#include <stdio.h>

#include <math.h>

#include <string.h>

#include <queue>

#include <stack>

#include <algorithm>

#include <map>

#include <string>

typedef long long LL;

#define INF 0x3f3f3f3f

#define met(a, b) memset(a, b, sizeof(a))

#define N 515

using namespace std;

int G[N][N], cnt[N], n, vis[N], dist[N], a[N], flag;

void Init()

{

    flag = ;

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

    {

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

            G[i][j] = INF;

        G[i][i] = vis[i] = cnt[i] = ;

        dist[i] = INF;

    }

}

void SPFA()

{

    cnt[] = ;

    dist[] = ;

    queue<int>Q;

    Q.push();

    vis[] = ;

    while(!Q.empty())

    {

        int p = Q.front();Q.pop();

        vis[p] = ;

        if(cnt[p] > n*)///说明存在负环，循环次数足够多，就可以让环上的点进队列的次数都大于n；

        {

            flag = ;

            return ;

        }

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

        {

            if(dist[i] > dist[p] + G[p][i])

            {

                dist[i] = dist[p] + G[p][i];

                if(!vis[i])

                {

                    vis[i] = ;

                    cnt[i]++;

                    Q.push(i);

                }

            }

        }

    }

}

int main()

{

    int T, t = ;

    scanf("%d", &T);

    while(T--)

    {

        int m, q, u, v;

        scanf("%d", &n);

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

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

        Init();

        scanf("%d", &m);

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

        {

            scanf("%d %d", &u, &v);

            G[u][v] = (a[v]-a[u])*(a[v]-a[u])*(a[v]-a[u]);

        }

        SPFA();

        scanf("%d", &q);

        printf("Case %d:\n", t++);

        while(q--)

        {

            scanf("%d", &u);

            if(cnt[u]<n && dist[u] != INF && dist[u]>=)

                printf("%d\n", dist[u]);

            else

                printf("?\n");

        }

    }

    return ;

}