// Problem: No.2604 Initial Motion // Contest: yukicoder // URL: https://yukicoder.me/problems/no/2604 // Memory Limit: 512 MB // Time Limit: 3000 ms #include<bits/stdc++.h> #include <atcoder/mincostflow> #define debug(x) cerr<<(#x)<<" "<<(x)<<endl using namespace atcoder; typedef long long ll; typedef long double ld; typedef unsigned long long ull; #define pii pair<ll,ll> #define rep(i,a,b) for(ll i=(a);i<=(b);++i) #define per(i,a,b) for(ll i=(a);i>=(b);--i) using namespace std; ll read(){ ll x=0,f=1;char ch=getchar(); while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();} while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();} return x*f; } void write(ll x){ if(x<0)putchar('-'),x=-x; if(x>9)write(x/10); putchar(x%10+'0'); } const ll N=2e3+5,INF=1e18; ll n,m; ll a[N],b[N],k; vector<pii>to[N]; int main(){ k=read(),n=read(),m=read(); rep(i,1,k)a[i]=read(); rep(i,1,n)b[i]=read(); mcf_graph<ll, ll> g(n+2); ll s = 0, t = n+1; rep(i,1,k)g.add_edge(s,a[i],1,0); rep(i,1,n){ if(b[i])g.add_edge(i,t,b[i],0); } rep(i,1,m){ ll x=read(),y=read(),z=read(); g.add_edge(x,y,INF,z); g.add_edge(y,x,INF,z); } pii result = g.flow(s, t, INF); write(result.second); return 0; }