#include<bits/stdc++.h>
#define rep(x,y,z) for(int x=y;x<=z;x++)
#define drep(x,y,z) for(int x=y;x>=z;x--)
#define ull unsigned long long
#define ll long long
using namespace std;
inline int read()
{
	int x=0;bool flag=1;char ch=getchar();
	while(ch<'0'||ch>'9') {if(ch=='-')flag=0;ch=getchar();}
	while(ch>='0'&&ch<='9') {x=(x<<3)+(x<<1)+ch-'0';ch=getchar();}
	if(flag) return x;
	return ~(x-1);
} 
inline void write(int x)
{
	if(x<0) {x=~(x-1);putchar('-');}
	if(x>9) write(x/10);
	putchar(x%10+'0');
}
////////////////////////////
const int N=2700;
const int M=1e4+50;
int nc,mc,kc;
ull f[N];
int hd[N];
struct qxx
{
	int ar;
	int nx;
}a[M<<1];
int aj;
inline void ADD(int x,int y)
{
	a[++aj].ar=y;
	a[aj].nx=hd[x];
	hd[x]=aj;
}
ull ans;
int d[10];
void dfs(int cl,int dep,ull ansp)
{
	if(dep==4)
	{
		for(int i=hd[cl];i;i=a[i].nx)
		{
			if(a[i].ar==1) 
			{
				ans=max(ans,ansp);
				return;
			}
		}
		return;
	}
	d[dep]=cl;
	int p;
	for(int i=hd[cl];i;i=a[i].nx)
	{
		p=0;
		for(int o=0;o<=dep;o++)
		{
			if(d[o]==a[i].ar) p=1;
		}
		if(!p) dfs(a[i].ar,dep+1,ansp+f[a[i].ar]);
	}
}
int main()
{
    freopen("csp2022_holiday.in","r",stdin);
	freopen("csp2022_holiday.out","w",stdout);
    nc=read(),mc=read(),kc=read();
	rep(i,2,nc) f[i]=read();
	int s1,s2;
	rep(i,1,mc)
	{
		s1=read(),s2=read();
		ADD(s1,s2);
		ADD(s2,s1);
	}
	dfs(1,0,0);
	cout<<ans<<endl;
    return 0;
}