#include<iostream>
#include<vector>
using namespace std;
const int maxn=105;
vector<int>G[maxn];
int n,m,v[maxn],Max,p[maxn],ans[maxn];
bool vis[maxn];
void dfs(int d,int va)
{
if(d==n+1)
{
if(Max<va)
{
Max=va;
for(int i=0;i<maxn;i++) ans[i]=p[i];
}
return ;
}
for(int i=0;i<G[d].size();i++)
{
int next=G[d][i];
if(!vis[next])
{
vis[next]=1;
p[next]=d;
dfs(next,va+v[next]);
vis[next]=0;
}
}
}
void print(int d)
{
if(d==1) cout<<1;
else
{
print(ans[d]);
if(d==n+1) d=1;
cout<<"->"<<d;
}
}
int main()
{
int t,Case=1;
cin>>t;
while(t--)
{
cout<<"CASE "<<Case++<<"#"<<endl;
fill(vis,vis+maxn,0);
for(int i=0;i<maxn;i++) G[i].clear();
cin>>n;
for(int i=1;i<=n;i++) cin>>v[i];
v[n+1]=0;
cin>>m;
for(int i=0;i<m;i++)
{
int x,y;
cin>>x>>y;
G[x].push_back(y);
}
vis[1]=1;
Max=0;
dfs(1,0);
cout<<"points : "<<Max<<endl;
cout<<"circuit : ";
print(n+1);
cout<<endl;
if(t) cout<<endl;
}
return 0;
}