#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

namespace solve {

const int N = 5e5 + 5;
int n, k, q, a[N];
ll f[N], g[N], t[N];
char s[N];
deque<int> Q;
int main() {
	scanf("%d %d", &n, &k);
	for(int i = 1; i <= n; i++) {
		scanf("%d", &a[i]);
	}
	a[0] = a[n + 1] = 0;
	scanf("%s %d", s + 1, &q);

	Q.clear();
	memset(f, 0x3f, sizeof(ll) * (n + 5));
	f[0] = 0;
	Q.push_back(0);
	for(int i = 1; i <= n + 1; i++) {
		while(i - Q.front() > k) Q.pop_front();
		f[i] = f[Q.front()] + a[i];
		if(s[i] == '1') {
			Q.clear();
		} else {
			while(!Q.empty() && f[Q.back()] >= f[i]) Q.pop_back();
		}
		Q.push_back(i);
	}

	Q.clear();
	memset(g, 0x3f, sizeof(ll) * (n + 5));
	g[n + 1] = 0;
	Q.push_back(n + 1);
	for(int i = n; i >= 0; i--) {
		while(Q.front() - i > k) Q.pop_front();
		g[i] = g[Q.front()] + a[i];
		if(s[i] == '1') {
			Q.clear();
		} else {
			while(!Q.empty() && g[Q.back()] >= g[i]) Q.pop_back();
		}
		Q.push_back(i);
	}

	// for(int i = 1; i <= n; i++) printf("%lld %lld\n", f[i], g[i]);

	auto get = [&](int c, int p) {
		return c < p ? f[c] : t[c];
	};

	while(q--) {
		int p, v;
		scanf("%d %d", &p, &v);
		Q.clear();
		for(int i = max(0, p - k); i < p; i++) {
			if(s[i] == '1') {
				Q.clear();
			} else {
				while(!Q.empty() && f[Q.back()] >= f[i]) Q.pop_back();
			}
			Q.push_back(i);
		}
		ll ans = LLONG_MAX;
		swap(a[p], v);
		for(int i = p; i <= min(n + 1, p + k); i++) {
			while(i - Q.front() > k) Q.pop_front();
			t[i] = get(Q.front(), p) + a[i];
			if(s[i] == '1') {
				while(!Q.empty()) Q.pop_back();
			} else {
				while(!Q.empty() && get(Q.back(), p) >= t[i]) Q.pop_back();
			}
			Q.push_back(i);
			if(i != p) ans = min(ans, t[i] + g[i] - a[i]);
		}
		swap(a[p], v);
		printf("%lld\n", ans);
	}

	return 0;
}

}

int main() {
	// freopen("0B.in", "r", stdin);
	int T;
	scanf("%d", &T);
	while(T--) {
		solve::main();
	}
	return 0;
}