#define ATCODER #define _USE_MATH_DEFINES #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; using ll = long long; using ld = long double; using pll = pair; using pdd = pair; //template using pq = priority_queue, greater>; #define FOR(i, a, b) for(ll i=(a); i<(b);i++) #define REP(i, n) for(ll i=0; i<(n);i++) #define ROF(i, a, b) for(ll i=(b-1); i>=(a);i--) #define PER(i, n) for(ll i=n-1; i>=0;i--) #define REPREP(i,j,a,b) for(ll i=0;i > #define VV2(type,n,m,val) vector< vector > val;val.resize(n);for(ll i;i #define VEC(type,n,val) vector val;val.resize(n) #define VL vector #define VVL vector< vector > #define VP vector< pair > #define SZ size() #define all(i) begin(i),end(i) #define SORT(i) sort(all(i)) #define BITI(i) (1<>i) & 1) != 0) #define ALLBIT(n) (ll(1)<v?v:n #define MP(a,b) make_pair(a,b) #define DET2(x1,y1,x2,y2) x1*y2-x2*y1 #define DET3(x1,y1,z1,x2,y2,z2,x3,y3,z3) x1*y2*z3+x2*y3*z1+x3*y1*z2-z1*y2*x3-z2*y3*x1-z3*y1*x2 #define INC(a) for(auto& v:a)v++; #define DEC(a) for(auto& v:a)v--; #define SQU(x) (x)*(x) #define L0 ll(0) #ifdef ATCODER #include using namespace atcoder; using mint = modint1000000007; using mint2 = modint998244353; #endif template vector read(size_t n) { vector ts(n); for (size_t i = 0; i < n; i++) cin >> ts[i]; return ts; } template void read_tuple_impl(TV&) {} template void read_tuple_impl(TV& ts) { get(ts).emplace_back(*(istream_iterator(cin))); read_tuple_impl(ts); } template decltype(auto) read_tuple(size_t n) { tuple...> ts; for (size_t i = 0; i < n; i++) read_tuple_impl(ts); return ts; } using val = pair; using func = ll; val op(val a, val b) { return MP(a.first + b.first, a.second + b.second); } val e() { return MP(0, 0); } val mp(func f, val a) { return MP(a.first + f * a.second, a.second); } func comp(func f, func g) { return f + g; } func id() { return 0; } ll di[4] = { 1,0,-1,0 }; ll dj[4] = { 0,1,0,-1 }; ll si[4] = { 0,3,3,0 }; ll sj[4] = { 0,0,3,3 }; //ll di[4] = { -1,-1,1,1 }; //ll dj[4] = { -1,1,-1,1 }; ll di8[8] = { 0,-1,-1,-1,0,1,1,1 }; ll dj8[8] = { -1,-1,0,1,1,1,0,-1 }; template class MinCostFlow { private: const cost_t INF = 1e9; struct Edge { int to, rev; capacity_t cap; cost_t cost; Edge(int to, int rev, capacity_t cap, cost_t cost) : to(to), rev(rev), cap(cap), cost(cost) {} }; vector> G; vector prev_v, prev_e; Edge& get_rev(Edge& edge) { return G[edge.to][edge.rev]; } public: MinCostFlow(int n) { G.resize(n); prev_v.resize(n); prev_e.resize(n); } void add_edge(int from, int to, capacity_t cap, cost_t cost) { G[from].push_back(Edge(to, (int)G[to].size(), cap, cost)); G[to].push_back(Edge(from, (int)G[from].size() - 1, 0, -cost)); } cost_t get_min_cost_flow(int s, int t, capacity_t flow) { int n = G.size(); cost_t res = 0; while (flow > 0) { vector dist(n, INF); dist[s] = 0; bool update = true; while (update) { update = false; for (int v = 0; v < n; v++) { if (dist[v] == INF) continue; for (int i = 0; i < G[v].size(); i++) { auto& edge = G[v][i]; if (edge.cap > 0 and dist[edge.to] > dist[v] + edge.cost) { dist[edge.to] = dist[v] + edge.cost; prev_v[edge.to] = v; prev_e[edge.to] = i; update = true; } } } } if (dist[t] == INF) return -1; capacity_t d = flow; for (int v = t; v != s; v = prev_v[v]) { d = min(d, G[prev_v[v]][prev_e[v]].cap); } flow -= d; res += d * dist[t]; for (int v = t; v != s; v = prev_v[v]) { G[prev_v[v]][prev_e[v]].cap -= d; get_rev(G[prev_v[v]][prev_e[v]]).cap += d; } } return res; } }; void solve() { ll k, n, m; cin >> k >> n >> m; VL a = read(k); DEC(a); VL b = read(n); mcf_graph mcf(n + 2); REP(i, m) { ll u, v, d; cin >> u >> v >> d; u--; v--; mcf.add_edge(u, v, 1e9, d); mcf.add_edge(v, u, 1e9, d); } VL c(n); REP(i, k) c[a[i]]++; REP(i, n) { if (c[i]) mcf.add_edge(n, i, c[i], 0); if (b[i]) mcf.add_edge(i, n + 1, b[i], 0); } cout << mcf.flow(n, n + 1, k).second << endl; return; } int main() { ll t = 1; ///cin >> t; while (t--) { solve(); } return 0; }