#include <cstdio>

#define I_F "subseta.in"
#define O_F "subseta.out"

const int MAXn=10000;

struct edge
{
	int x;
	edge *next;
};

int n;
int s[MAXn];
edge* map[MAXn]={NULL};
long ans;
short f[MAXn]={0};

void Input();
void Dfs(const int&, const long&);
void Output();

int main()
{
	Input();
	Dfs(0,0);
	Output();
	return 0;
}

void Input()
{
	long m;
	int a,b;
	edge *temp;
	freopen(I_F,"r",stdin);
	scanf("%d",&n);
	for (int i=0; i<n; ++i)
		scanf("%d",&s[i]);
	for (scanf("%ld",&m); m>0; --m)
	{
		scanf("%d%d",&a,&b);
		temp=map[--a];
		map[a]=new edge;
		map[a]->x=--b;
		map[a]->next=temp;
		temp=map[b];
		map[b]=new edge;
		map[b]->x=a;
		map[b]->next=temp;
	}
}

void Dfs(const int &x, const long &w)
{
	if (x>=n)
		ans=(ans>w)?ans:w;
	else
	{
		bool flag=true;
		for (edge *i=map[x]; i!=NULL && flag; i=i->next)
			if (f[i->x]==1)
				flag=false;
		if (flag)
		{
			f[x]=1;
			Dfs(x+1,w+s[x]);
			f[x]=0;
		}
		Dfs(x+1,w);
	}
}

void Output()
{
	freopen(O_F,"w",stdout);
	printf("%ld\n",ans);
}