#include <bits/stdc++.h> 

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

const int N = 474;

int n, m;
bool g[N][N];

void solve()
{
	VI s(n);
	for (int& si : s)
		cin >> si;
	FOR(i, 0, n)
		FOR(j, 0, n)
			g[i][j] = false;
	FOR(i, 0, m)
	{
		int u, v;
		cin >> u >> v;
		u--;
		v--;
		g[u][v] = g[v][u] = true;
	}
	int ans = 0;
	FOR(v1, 0, n)
	{
		FOR(v2, v1 + 1, n)
		{
			if (!g[v1][v2])
				continue;
			ans = max(ans, s[v1] + s[v2]);
			FOR(v3, v2 + 1, n)
			{
				if (!g[v1][v3] || !g[v2][v3])
					continue;
				ans = max(ans, s[v1] + s[v2] + s[v3]);
				FOR(v4, v3 + 1, n)
				{
					if (!g[v1][v4] || !g[v2][v4] || !g[v3][v4])
						continue;
					ans = max(ans, s[v1] + s[v2] + s[v3] + s[v4]);
				}
			}
		}
	}
	cout << ans << "\n";
}

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	while (cin >> n >> m)
		solve();
	return 0;
}