#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }


// op: T * T -> T, associative
template <class T, class Op> struct Queue {
  const Op op;
  vector<T> as, aas, bs, bbs;

  Queue(Op op_) : op(op_) {}

  void reserve(int n) {
    as.reserve(n);
    aas.reserve(n);
    bs.reserve(n);
    bbs.reserve(n);
  }
  void reduce() {
    for (; !bs.empty(); bs.pop_back(), bbs.pop_back()) {
      as.push_back(bs.back());
      aas.push_back(aas.empty() ? bs.back() : op(bs.back(), aas.back()));
    }
  }
  T get() {
    if (as.empty()) reduce();
    assert(!as.empty());
    return bbs.empty() ? aas.back() : op(aas.back(), bbs.back());
  }

  bool empty() const {
    return (as.empty() && bs.empty());
  }
  int size() const {
    return as.size() + bs.size();
  }
  T front() {
    if (as.empty()) reduce();
    assert(!as.empty());
    return as.back();
  }
  void push(const T &t) {
    bs.push_back(t);
    bbs.push_back(bbs.empty() ? t : op(bbs.back(), t));
  }
  void pop() {
    if (as.empty()) reduce();
    assert(!as.empty());
    as.pop_back();
    aas.pop_back();
  }
  void clear() {
    as.clear();
    aas.clear();
    bs.clear();
    bbs.clear();
  }
};

////////////////////////////////////////////////////////////////////////////////


constexpr Int INF = 1001001001001001001LL;

int N, K;
vector<Int> A;
char S[500'010];

vector<Int> solve() {
  vector<Int> dp(N + 2, INF);
  dp[0] = 0;
  auto op = [&](Int x, Int y) -> Int {
    return min(x, y);
  };
  Queue<Int, decltype(op)> que(op);
  for (int i = 0; i <= N + 1; ++i) {
    if (i > 0) {
      for (; que.size() > K; ) {
        que.pop();
      }
      dp[i] = que.get() + A[i];
    }
    if (S[i] == '1') {
      for (; que.size() > 0; ) {
        que.pop();
      }
    }
    que.push(dp[i]);
  }
  return dp;
}

int main() {
  for (int numCases; ~scanf("%d", &numCases); ) { for (int caseId = 1; caseId <= numCases; ++caseId) {
    scanf("%d%d", &N, &K);
    A.resize(N + 2);
    for (int i = 1; i <= N; ++i) scanf("%lld", &A[i]);
    scanf("%s", S + 1);
    A[0] = A[N + 1] = 0;
    S[0] = S[N + 1] = '1';
    S[N + 2] = 0;
    
    auto ls = solve();
    reverse(A.begin(), A.end());
    reverse(S, S + (N + 2));
    auto rs = solve();
    reverse(rs.begin(), rs.end());
    reverse(A.begin(), A.end());
    reverse(S, S + (N + 2));
// cerr<<"ls = "<<ls<<endl;
// cerr<<"rs = "<<rs<<endl;
    
    vector<Int> lls(K), rrs(K);
    int Q;
    scanf("%d", &Q);
    for (; Q--; ) {
      int pos;
      Int val;
      scanf("%d%lld", &pos, &val);
      
      Int ans = INF;
      if (S[pos] == '1') {
        ans = ls[N + 1] - A[pos] + val;
      } else {
        ans = (ls[pos] - A[pos]) + val + (rs[pos] - A[pos]);
        fill(lls.begin(), lls.end(), INF);
        fill(rrs.begin(), rrs.end(), INF);
        for (int k = 1; k < K; ++k) {
          lls[k] = ls[pos - k];
          if (S[pos - k] == '1') break;
        }
        for (int k = 1; k < K; ++k) {
          rrs[k] = rs[pos + k];
          if (S[pos + k] == '1') break;
        }
// cerr<<pos<<" "<<val<<" "<<lls<<" "<<rrs<<endl;
        Int mn = INF;
        for (int k = K; --k >= 1; ) {
          chmin(mn, rrs[K - k]);
          chmin(ans, lls[k] + mn);
        }
      }
      printf("%lld\n", ans);
    }
  }
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}