#include<iostream>
#include<cstdio>
#include<cstring>
#include<iomanip>
#include<cmath>
#include<vector>
#include<algorithm>
#include<queue>
#define ll long long
#define maxn 1001
using namespace std;
int n,m;
int a[maxn],b[maxn];
struct node {int to,next;} e[maxn*maxn];
int cnt,linkk[maxn];
inline void insert(int x,int y) {cnt++;e[cnt].to=y;e[cnt].next=linkk[x];linkk[x]=cnt;}
struct nodes{int a,b;} choose[maxn];
bool my(nodes a,nodes b) {if(a.a==b.a) return a.b<a.a; return a.a>b.a;}
int num;
void work()
{
	int ans=0,sum=0,summ[maxn],minn;
	for(int i=1;i<=n;i++)
	{
		num=0,sum=0,minn=9999999;
		memset(summ,0,sizeof(summ));
		for(int k=linkk[i];k;k=e[k].next)
		{
			int to=e[k].to;
			num++;
			choose[num].a=a[to];
			choose[num].b=b[to];
		}
		sort(choose+1,choose+num+1,my);
		for(int i=1;i<=num;i++) summ[i]=summ[i-1]+choose[i].b;
		for(int j=1;j<=num;j++)
		{
			int tt=choose[j].a+summ[j-1];
			if(tt<minn) minn=tt;
			if(j==num) 
			{
				tt=summ[j];
				if(tt<minn) minn=tt;
			}
		}
		if(num!=0) ans+=minn;
	}
	printf("%d\n",ans);
}
int main()
{
	freopen("energynet.in", "r", stdin);
	freopen("energynet.out", "w", stdout);
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++) scanf("%d",&a[i]);
	for(int i=1;i<=n;i++) scanf("%d",&b[i]);
	for(int i=1;i<=m;i++) 
	{
		int x,y;
		scanf("%d%d",&x,&y);
		insert(x,y);
	}
	work();
	return 0;
}