#include<iostream>
#include<cstdio>
#include<cmath>
#include<queue>
#include<cstring>
#include<algorithm>
#define LL long long int
#define Redge(u) for (int k = h[u],to; k; k = ed[k].nxt)
#define REP(i,n) for (int i = 1; i <= (n); i++)
#define BUG(s,n) for (int i = 1; i <= (n); i++) cout<<s[i]<<' '; puts("");
#define cls(s) memset(s,0,sizeof(s))
#define eps 1e-9
using namespace std;
const int maxn=(510)<<1,maxm=10010*4,INF = 1000000000;
inline int read(){
int out = 0,flag = 1; char c = getchar();
while (c < 48 || c > 57){if (c == '-') flag = -1; c = getchar();}
while (c >= 48 && c <= 57){out = (out << 3) + (out << 1) + c - 48; c = getchar();}
return out * flag;
}
int h[maxn],ne = 2;
struct EDGE{int to,nxt; int f;}ed[maxm];
int n,m,a,b,c,s;
LL ke[maxn],val[maxn];
inline void build(int u,int v,int f){
ed[ne] = (EDGE){v,h[u],f}; h[u] = ne++;
ed[ne] = (EDGE){u,h[v],0}; h[v] = ne++;
}
int d[maxn],vis[maxn],cur[maxn],S,T;
bool bfs(){
cls(d); cls(vis); vis[S] = true;
queue<int> q; q.push(S);
int u;
while (!q.empty()){
u = q.front(); q.pop();
Redge(u) if (fabs(ed[k].f) > eps && !vis[to = ed[k].to]){
d[to] = d[u] + 1; vis[to] = true;
if (to == T) return true;
q.push(to);
}
}
return vis[T];
}
LL dfs(int u,int minf){
if (u == T || abs(minf) < eps) return minf;
int f,flow = 0; int to;
if (cur[u] == -1) cur[u] = h[u];
for (int& k = cur[u]; k; k = ed[k].nxt){
if (d[to = ed[k].to] == d[u] + 1 && abs(f = dfs(to,min(minf,ed[k].f))) >= eps){
ed[k].f -= f; ed[k ^ 1].f += f;
flow += f; minf -= f;
if (abs(minf) < 0) break;
}
}
return flow;
}
LL maxflow(){
LL flow = 0;
while (bfs()){
memset(cur,-1,sizeof(cur));
flow += dfs(S,INF);
}
return flow;
}
int main(){
for(int Case=read();Case;Case--)
{
ne=2;
cls(h);
n=read();m=read();s=read();
S=2*n+1;T=s+n;
while(m--)
{
a=read(),b=read(),c=read();
build(a+n,b,c);
}
for(int i=1;i<=n;i++)val[i]=read(),build(S,i,val[i]);
for(int i=1;i<=n;i++)ke[i]=read(),build(i,i+n,ke[i]);
printf("%lld\n",maxflow());
}
return 0;
}