#include <bits/stdc++.h>

using namespace std;

void fast_io() {
	ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
}
#include <atcoder/maxflow>
using namespace atcoder;
int main() {
	fast_io();
	const long long INF = 1e18;
	int n;
	cin >> n;
	vector<long long> p(n);
	for (int i = 0; i < n; i++) {
		cin >> p[i];
	}
	int m;
	cin >> m;
	vector<int> u(m), v(m);
	for (int i = 0; i < m; i++) {
		cin >> u[i] >> v[i];
		u[i]--;
		v[i]--;
	}
	int k;
	cin >> k;
	vector<int> a(k), b(k), s(k);
	for (int i = 0; i < k; i++) {
		cin >> a[i] >> b[i] >> s[i];
		a[i]--;
		b[i]--;
	}
	mf_graph<long long> g(n + k + 2);
	int src = n + k, sink = n + k + 1;
	for (int i = 0; i < n; i++) {
		if (p[i] > 0) {
			g.add_edge(src, i, p[i]);
		} else if (p[i] < 0) {
			g.add_edge(i, sink, -p[i]);
		}
	}
	for (int i = 0; i < m; i++) {
		g.add_edge(v[i], u[i], INF);
	}
	for (int i = 0; i < k; i++) {
		g.add_edge(src, n + i, s[i]);
		g.add_edge(n + i, a[i], INF);
		g.add_edge(n + i, b[i], INF);
	}
	g.flow(src, sink);
	auto min_cut = g.min_cut(src);
	long long ans = 0;
	for (int i = 0; i < n; i++) {
		if (min_cut[i]) {
			ans += p[i];
		}
	}
	for (int i = 0; i < k; i++) {
		if (min_cut[a[i]] && min_cut[b[i]]) {
			ans += s[i];
		}
	}
	cout << ans << endl;
}