#include <cstdio>
#include <cstring>
using namespace std;

typedef int Vert;
typedef int Flow;
enum  {N = 128};
Flow    G[N][N];
int  blocked[N];

Flow dfs( Vert v, Vert Sink, Vert* L[], Flow flow_in )
{
	Flow flow_out = 0;
	for(Vert *p=*L,*q=*++L; p!=q; ++p)
		if( G[v][*p] )
		{
			Flow f = flow_in-flow_out <? G[v][*p];
			if( *p==Sink || !blocked[*p] && (f=dfs(*p,Sink,L,f)) )
			{
				G[v][*p] -= f;
				G[*p][v] += f;
				flow_out += f;
				if(flow_in == flow_out) return flow_out;
			}
		}
	blocked[v] = (flow_out==0);
	return flow_out;
}

Flow dinic( int n, Vert Src, Vert Sink )
{
	for( Flow total=0 ;; )
	{
		// L[k]～L[k+1] = Srcからk+1ステップで行ける頂点。BFSで求める
		Vert Q[N], *Qp=Q, *Qq=Q+1, *L[N], **Lp=L;
		*Qp = Src;
		int reached[N] = {true};
		for( ; !reached[Sink] && Qp<Qq; *Lp++=Qp )
			for(Vert* Qe=Qq; Qp<Qe; ++Qp)
				for(Vert u=0; u!=n; ++u)
					if( G[*Qp][u] && !reached[u] )
						*Qq++ = u, reached[u] = true;
		*Qp = Sink;
		*Lp = Qp+1;

		// Sinkまで行けなくなったので最大流の計算完了
		if( !reached[Sink] )
			return total;

		// DFSで流しまくる
		memset( blocked, 0, sizeof(blocked) );
		total += dfs( Src, Sink, L, 0x7fffffff );
	}
}

int main()
{
	int n,np,nc,m,u,v,z;
	while( scanf("%d %d %d %d",&n,&np,&nc,&m) > 0 )
	{
		memset(G, 0, sizeof(G));
		while(m--)
		{
			scanf(" (%d,%d)%d", &u, &v, &z);
			G[u+2][v+2] = z;
		}
		while(np--)
		{
			scanf(" (%d)%d", &u, &z);
			G[0][u+2] = z;
		}
		while(nc--)
		{
			scanf(" (%d)%d", &u, &z);
			G[u+2][1] = z;
		}
		printf("%d\n", dinic(n+2,0,1));
	}
}