#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<queue>
using namespace std;
const int MAXN = 220;
int Map[MAXN][MAXN],pre[MAXN];
int N,NP,NC,M;
bool EkBFS(int start,int end)
{
queue<int> Q;
bool vis[MAXN];
memset(vis,false,sizeof(vis));
memset(pre,-1,sizeof(pre));
Q.push(start);
vis[start] = true;
while( !Q.empty() )
{
int u = Q.front();
if(u == end)
return true;
Q.pop();
for(int i = 0; i <= N+1; ++i)
{
if(Map[u][i] && !vis[i])
{
vis[i] = true;
pre[i] = u;
Q.push(i);
}
}
}
return false;
}
int EkMaxFlow(int start,int end)
{
int v,Ans = 0,MinN;
while(EkBFS(start,end))
{
MinN = 0xffffff0;
v = end;
while( pre[v] != -1)
{
MinN = min(MinN,Map[pre[v]][v]);
v = pre[v];
}
Ans += MinN;
v = end;
while( pre[v] != -1)
{
Map[pre[v]][v] -= MinN;
Map[v][pre[v]] += MinN;
v = pre[v];
}
}
return Ans;
}
int main()
{
char ch;
int u,v,w;
while(~scanf("%d %d %d %d ",&N,&NP,&NC,&M))
{
memset(Map,0,sizeof(Map));
for(int i = 0; i < M; ++i)
{
while( (ch = getchar())!='(' );
scanf("%d",&u);
getchar();
scanf("%d",&v);
getchar();
scanf("%d",&w);
Map[u][v] = w;
}
for(int i = 0; i < NP+NC; ++i)
{
while( (ch = getchar())!='(' );
scanf("%d",&u);
getchar();
scanf("%d",&w);
if(i < NP)
Map[N][u] = w;
else
Map[u][N+1] = w;
}
printf("%d\n",EkMaxFlow(N,N+1));
}
return 0;
}