//from duckindog wth depression
#include<bits/stdc++.h>

using namespace std;

#define int long long

const int N = 5e5 + 10;
int n, k;
int a[N];
string s;
int f[N], g[N], h[N];
int q;

int32_t main() {
  cin.tie(0)->sync_with_stdio(0);

  if (fopen("duck.inp", "r")) {
    freopen("duck.inp", "r", stdin);
    freopen("duck.out", "w", stdout);
  }
  int test; cin >> test;
  while (test--) {
    cin >> n >> k;
    for (int i = 1; i <= n; ++i) cin >> a[i];
    a[n + 1] = f[n + 1] = g[n + 1] = 0;
    cin >> s; s = '@' + s;
    deque<int> dq;
    dq.push_back(0);
    for (int i = 1; i <= n; ++i) {
      while (dq.size() && dq.back() < i - k) dq.pop_back();
      f[i] = f[dq.back()] + a[i];
      while (dq.size() && f[dq.front()] >= f[i]) dq.pop_front();
      if (s[i] == '1') dq.clear();
      dq.push_front(i);
    }
    dq.clear();
    dq.push_back(n + 1);
    for (int i = n; i >= 1; --i) {
      while (dq.size() && dq.back() > i + k) dq.pop_back();
      g[i] = g[dq.back()] + a[i];
      while (dq.size() && g[dq.front()] >= g[i]) dq.pop_front();
      if (s[i] == '1') dq.clear();
      dq.push_front(i);
    }

    cin >> q;
    while (q--) {
      int p, v; cin >> p >> v;
      int pre = a[p]; a[p] = v;
      for (int i = p; i <= min(n, p + k); ++i) h[i] = f[i];
      dq.clear();
      for (int i = max(0ll, p - k); i < p; ++i) {
        while (dq.size() && f[dq.front()] >= f[i]) dq.pop_front();
        if (s[i] == '1') dq.clear();
        dq.push_front(i);
      }
      for (int i = p; i <= min(n, p + k); ++i) {
        while (dq.size() && dq.back() < i - k) dq.pop_back();
        f[i] = f[dq.back()] + a[i];
        while (dq.size() && f[dq.front()] >= f[i]) dq.pop_front();
        if (s[i] == '1') dq.clear();
        dq.push_front(i);
      }
      int mi = 1e9;
      int it = dq.back();
      for (int i = it + 1; i <= min(n + 1, it + k); ++i) {
        mi = min(mi, g[i]);
        if (s[i] == '1') {
           mi = g[i];
          break;
        }
      }
      cout << f[it] + mi << "\n";
      for (int i = p; i <= min(n, p + k); ++i) f[i] = h[i];
    }


  }

}