#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint998244353;
//const int mod = 998244353;
//using mint = modint1000000007;
//const int mod = 1000000007;
const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int k, n, m; cin >> k >> n >> m;
	vector<int>a(k);
	vector<long long>b(n);
	rep(i, k)cin >> a[i], a[i]--;
	rep(i, n)cin >> b[i];

	int st = n;
	int ed = st + 1;
	mcf_graph<int, long long>g(ed + 1);
	rep(i, k) {
		g.add_edge(st, a[i], 1, 0);
	}
	rep(i, m) {
		int u, v;
		long long d;
		cin >> u >> v >> d;
		u--, v--;
		g.add_edge(u, v, INF, d);
		g.add_edge(v, u, INF, d);
	}
	rep(i, n) {
		g.add_edge(i, ed, b[i], 0);
	}
	auto result = g.flow(st, ed, k);
	cout << result.second << endl;
	return 0;
}