#include<bits/stdc++.h>
using namespace std;
int n, m, ans,v[500], use[500], k, c[500];
bool b[5100][5100];
bool f(int x, int k) {
	for(int i = 1;i <= k;i ++)
		if(b[i][x] == 0) return 0;
	return 1;
}
void dfs(int l, int s) {
	if(s > ans) ans = s;
	for(int i = 1;i <= n;i ++) {
		if(l == 1 || use[i] == 0 && f(i,k)) {
			use[i] = 1;
			c[++k] = i;
			dfs(l + 1, s + v[i]);
			use[i] = 0;
			k --;
		}
	}
}
int main(){
	cin >> n >> m;
	for(int i = 1;i <= n;i ++) cin >> v[i];
	for(int i = 1;i <= m;i ++) {
		int x, y;
		cin >> x >> y;
		b[x][y] = 1;
		b[y][x] = 1;
	}
	dfs(1, 0);
	cout << ans;
	return 0;
}

提交记录