#include <iostream> 
#include <cmath> 
#include <cstring> 
#include <string> 
#include <cstdio> 
#include <cstdlib> 
#include <iomanip> 
#include <set> 
#include <vector>
#include <algorithm> 
#define MAXN 0x7fffffff 
using namespace std; 
int a[10001],b,c,d,l,m,n,r[10001],s,t;
vector <int> v[10001]; 
int bo[10001];
void DFS(void)
{
	int i;
	for (i=1;i<=b;i++) 
		if (bo[i]==0)
		{
			t+=a[i];
			if (t>s) s=t;
			bo[i]++;
			for (d=0;d<v[i].size();d++) bo[v[i][d]]++;
			DFS();
			t-=a[i];
			for (d=0;d<v[i].size();d++) bo[v[i][d]]--;
			bo[i]--;
		}
}
int main(void) 
{    
    freopen("subseta.in","r",stdin); 
    freopen("subseta.out","w",stdout); 
	scanf("%d",&b);
	for (c=1;c<=b;c++) scanf("%d",&a[c]);
	scanf("%d",&c);
	for (d=0;d<c;d++)
	{
		scanf("%d%d",&l,&m);
		v[l].push_back(m);
		v[m].push_back(l);
	}
	DFS();
	printf("%d",s);
	fclose(stdin); 
    fclose(stdout); 
    return 0; 
}