#include<bits/stdc++.h>
using namespace std;
const int N=2e6+5;
int n,m,a[N],q,stc[N],top,dfn[N],low[N],vis[N],cn,dn,w[N],col[N],c[N],d[N],ans;
vector<pair<int,int> > G[N];
vector<int> D[N];
int read(){
	int x=0,ff=1;char ch=getchar();
	while(ch<'0'||ch>'9') {if(ch=='-') {ff=-1;} ch=getchar();};
	while(ch>='0'&&ch<='9') x=x*10+ch-48,ch=getchar();
	return x*ff;
}
void form(int u){
	++cn;
	for(int x=0;x!=u;) {
		x=stc[top--];
		vis[x]=0;
		col[x]=cn;
		w[cn]+=a[x];
	}
}
void tarjan(int u,int eid){
	dfn[u]=low[u]=++dn;
	stc[++top]=u;vis[u]=1;
	for(auto [v,id] : G[u]){
		if(id==eid) continue;
		if(!dfn[v]){
			tarjan(v,id);
			low[u]=min(low[u],low[v]);
		} else if(vis[v]) low[u]=min(low[u],dfn[v]);
	}
	if(dfn[u]==low[u]) form(u);
}
int fa[N],dep[N],siz[N],bson[N],Top[N];
void dfs1(int u,int f){
	fa[u]=f;dep[u]=dep[f]+1;siz[u]=1;
	for(auto v : D[u]){
		if(v==f) continue;
		dfs1(v,u);
		siz[u]+=siz[v];
		if(siz[v]>siz[bson[u]]) bson[u]=v;
	}
}
void dfs2(int u,int t){
	Top[u]=t;
	if(bson[u]) dfs2(bson[u],t);
	for(auto v : D[u]){
		if(v==bson[u]||v==fa[u]) continue;
		dfs2(v,v);
	}
}
int lca(int x,int y){
	while(Top[x]!=Top[y]){
		if(dep[Top[x]]<dep[Top[y]]) swap(x,y);
		x=fa[Top[x]];
	}
	if(dep[x]<dep[y]) swap(x,y);
	return y;
}
int vi[N];
void dfs(int u){
	vi[u]=1;
	for(auto v : D[u]){
		if(v==fa[u]||vi[v]) continue;
		dfs(v);
		c[u]+=c[v];
	}
	if(c[u]) ans+=w[u];
}
int main(){
	//freopen("my.txt","r",stdin);
	n=read();m=read();
	for(int i=1;i<=n;i++) a[i]=read();
	for(int i=1;i<=m;i++){
		int u,v;u=read();v=read();
		G[u].push_back({v,i});
		G[v].push_back({u,i});
	}
	for(int i=1;i<=n;i++) if(!dfn[i]) tarjan(i,0);
	q=read();
	for(int u=1;u<=n;u++){
		for(auto [v,id] : G[u]){
			if(col[u]!=col[v]){
				D[col[u]].push_back(col[v]);
			}
		}
	}
	dfs1(1,0);dfs2(1,1);
	while(q--){
		int x,y;x=read();y=read();
		c[col[x]]++;
		c[col[y]]++;
		c[lca(col[x],col[y])]--;
		c[fa[lca(col[x],col[y])]]--;
	}
	dfs(1);
	printf("%d\n",ans);
	return 0;
}