// xxc
#include<bits/stdc++.h>
using namespace std;

#define endl '\n'
#define IOS ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
#define ll long long
#define int long long
#define debug(x) cout << #x << ' ' << x << endl;

const int N = 5e5 + 10;

ll predp[N],sufdp[N];//选中这个位置，需要最小的价值

int a[N];

void test(){
	int n,k;cin >> n >> k;
	for(int i = 1;i <= n;i++) cin >> a[i];
	string s;cin >> s;
	s = ' ' + s;
	
	queue<pair<int,ll>> qu;
	
	qu.push({0,0});
	predp[0] = 0;
	
	for(int i = 1;i <= n;i++){
		predp[i] = qu.front().second + a[i];
		if(s[i] == '1') while(!qu.empty()) qu.pop();
		while(!qu.empty() && (i - qu.front().first >= k || qu.front().second > predp[i])) qu.pop();
		qu.push({i,predp[i]});
	}
	
	predp[n + 1] = qu.front().second;
	while(!qu.empty()) qu.pop();
	
	qu.push({n + 1,0});
	sufdp[n + 1] = 0;
	
	for(int i = n;i >= 1;i--){
		sufdp[i] = qu.front().second + a[i];
		if(s[i] == '1') while(!qu.empty()) qu.pop();
		while(!qu.empty() && (qu.front().first - i >= k || qu.front().second > sufdp[i])) qu.pop();
		qu.push({i,sufdp[i]});
	}
	
	sufdp[0] = qu.front().second;
	
	int q;cin >> q;
	for(int i = 1;i <= q;i++){
		int p,v;cin >> p >> v;
		if(s[p] == '1'){
			cout << sufdp[0] + v - a[p] << '\n';
		}else{
			ll ans = sufdp[p] + predp[p] + v - a[p] * 2;
			ll mi = sufdp[p + 1];
			int j = p + 2;
			for(int ii = max(0ll,p - k + 1);ii <= p - 1;ii++){
				while(j <= n + 1 && j - ii <= k) mi = min(sufdp[j],mi),j++;
				ans = min(predp[ii] + mi,ans);
			}
			cout << ans << '\n';
		}
	}
}

signed main(){
	IOS
	int t = 1;cin >> t;
	while(t--){
		test();
	}
}