#include<bits/stdc++.h> 
#define ll long long 
#define x first 
#define y second 
#define il inline 
#define em emplace 
#define eb emplace_back 
#define debug() puts("-----") 
using namespace std; 
typedef pair<int,int> pii; 
il int read(){ 
	int 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<<1)+(x<<3)+(ch^48),ch=getchar(); 
	return x*f; 
} 
const int N=2e5+10; 
int n,k; 
ll f[N]; 
int a[N]; 
bool st[N]; 
int q[N],hh,tt;  
il void solve(){ 
	n=read(),k=read(); ll sum=0; 
	for(int i=1;i<=n;i++) a[i]=read(); 
	for(int i=1;i<=n;i++){ 
		char c; cin>>c; 
		if(c=='1') st[i]=true,sum+=a[i]; 
		else st[i]=false; 
	} int Q=read(); 
	while(Q--){ 
		int x=read(),v=read(); 
		int lst=a[x]; 
		if(st[x]) sum-=a[x],sum+=v; 
		else a[x]=v; hh=tt=0,q[0]=0; 
		for(int i=1;i<=n;i++){ 
			while(hh<=tt&&i-q[hh]>k) hh++; 
			int val=a[i]; if(st[i]) val=0; 
			f[i]=f[q[hh]]+val; 
			while(hh<=tt&&f[q[tt]]>=f[i]) tt--; 
			q[++tt]=i; 
		} ll ans=1e18; 
		for(int i=n;i>=max(0,n-k+1);i--) ans=min(ans,f[i]+sum); 
		printf("%lld\n",ans); 
		if(!st[x]) a[x]=lst; 
	} 
} 
signed main(){ 
	int T=read(); 
	while(T--) solve(); 
	return 0; 
} /*
1
5 6
1 1 1 1 1
00100
1
3 100

3
10 3
5 10 7 100 4 3 12 5 100 1
0001000010
2
2 3
6 15
5 6
1 1 1 1 1
00000
1
3 100
5 6
1 1 1 1 1
00100
1
3 100
*/