#include <bits/stdc++.h> 
using namespace std;
const int N = 2510,M = 20010;
int n,m,k,ans;
int a[N],h[N],v[N],tot;
struct made{
	int pr,nx;
}p[M];
void add(int x,int y){
	tot++;
	p[tot].pr = y,p[tot].nx = h[x];h[x] = tot;
}
void sou(int u,int d,int s){
	if(u == 1 && d == 5){
		ans = max(ans,s);
		return;
	}
	if(v[u] || d > 4)return;
	for(int i = h[u];i;i = p[i].nx){
		int y = p[i].pr;
	    v[u] = 1;
	    sou(y,d+1,s+a[y]);
		v[u] = 0;
	}
}
int main(){
	freopen("csp2022_holiday.in","r",stdin);
	freopen("csp2022_holiday.out","w",stdout);
    scanf("%d%d%d",&n,&m,&k);
    for(int i = 2;i <= n;i++)scanf("%d",&a[i]);
    for(int i = 1;i <= m;i++){
    	int x,y;
    	scanf("%d%d",&x,&y);
    	add(x,y);add(y,x);
	} 
	sou(1,0,0);
	printf("%d\n",ans);
	
	return 0;
}