/**
	author:  shobonvip
	created: 2025.07.12 05:57:13
**/

#include<bits/stdc++.h>
using namespace std;

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)
#define all(v) v.begin(), v.end()

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	// 一生燃やす埋めるに気付かない

	int n; cin >> n;
	vector<ll> p(n);
	rep(i,0,n) cin >> p[i];

	int m; cin >> m;
	vector<int> u(m), v(m);
	rep(i,0,m) {
		cin >> u[i] >> v[i];
		u[i]--;
		v[i]--;
	}

	int k; cin >> k;
	vector<int> a(k), b(k);
	vector<ll> s(k);
	rep(i,0,k) {
		cin >> a[i] >> b[i] >> s[i];
		a[i]--; b[i]--;
	}

	ll geta = 0;
	mf_graph<ll> mf(n+k+2);
	rep(i,0,n) {
		if (p[i] > 0) {
			geta += p[i];
			mf.add_edge(n+k,i,0);
			mf.add_edge(i,n+k+1,p[i]);
		}else{
			mf.add_edge(n+k,i,-p[i]);
			mf.add_edge(i,n+k+1,0);		
		}
	}
	rep(i,0,k) {
		geta += s[i];
		mf.add_edge(n+k,i+n,0);
		mf.add_edge(i+n,n+k+1,s[i]);
		mf.add_edge(a[i],i+n,(ll)1e14);
		mf.add_edge(b[i],i+n,(ll)1e14);
	}
	rep(i,0,m) {
		mf.add_edge(v[i],u[i],(ll)1e14);
	}
	ll ans=-mf.flow(n+k,n+k+1)+geta;
	cout<<ans<<endl;
}