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

#define int long long
const int inf = 1e18;
void solve() {
    int n, k; cin >> n >> k;
    vector<int> a(n + 2);
    for(int i = 1; i <= n; i++) cin >> a[i];
    string s; cin >> s;
    s = "1" + s + "1";
    vector<int> dp1(n + 2, inf), dp2(n + 2, inf);
    vector<int> last(n + 2), nex(n + 2);
    dp1[0] = 0;
    dp2[n + 1] = 0;
    for(int i = 0; i <= n + 1; i++) {
        if(s[i] == '1') {
            last[i] = i;
        } else {
            last[i] = last[i - 1];
        }
    }
    for(int i = n + 1; i >= 0; i--) {
        if(s[i] == '1') {
            nex[i] = i;
        } else {
            nex[i] = nex[i + 1];
        }
    }
    deque<int> dq;
    dq.push_back(0);
    for(int i = 1; i <= n + 1; i++) {
        int L = max(last[i - 1], i - k);
        // cerr << "i = " << i << " dq.front() = " << dq.front() << "\n";
        while(dq.front() < L) dq.pop_front();
        dp1[i] = dp1[dq.front()] + a[i];
        while(dq.size() && dp1[dq.back()] >= dp1[i]) dq.pop_back();
        dq.push_back(i);
    }
    dq.clear();
    dq.push_back(n + 1);
    for(int i = n; i >= 0; i--) {
        int R = min(nex[i + 1], i + k);
        while(dq.front() > R) dq.pop_front();
        dp2[i] = dp2[dq.front()] + a[i];
        while(dq.size() && dp2[dq.back()] >= dp2[i]) dq.pop_back();
        dq.push_back(i);
    }
    // cerr << dp2[0] << "\n";
    int q; cin >> q;
    while(q--) {
        int p, x; cin >> p >> x;
        int prea = a[p];
        a[p] = x;
        deque<int> dq1;
        deque<int> dq2;
        vector<int> nowdp(k);
        auto getdpval = [&] (int idx) {
            if(idx >= p) return nowdp[idx - p];
            else return dp1[idx];
        };
        int pt2 = p + 1;
        int ans = inf;
        for(int i = max(0LL, p - k); i <= min(n + 1, p + k - 1); i++) {
            // cerr << "i = " << i << "\n";
            if(i >= p) {
                int L = max(last[i - 1], i - k);
                while(dq1.size() && dq1.front() < L) dq1.pop_front();
                nowdp[i - p] = getdpval(dq1.front()) + a[i];
                // cerr << "dp[i] = " << getdpval(i) << "\n";
                if(i <= n) {
                        // cerr << "pt2 = " << pt2 << " i = " << i << " dqb = " << nex[i + 1] << "\n";
                    while(pt2 <= n + 1 && pt2 <= min(nex[i + 1], i + k)) {
                        while(dq2.size() && dp2[dq2.back()] >= dp2[pt2]) dq2.pop_back();
                        dq2.push_back(pt2);
                        pt2++;
                    }
                    while(dq2.size() && dq2.front() <= i) dq2.pop_front();
                    ans = min(ans, getdpval(i) + dp2[dq2.front()]);
                } else {
                    ans = min(ans, getdpval(i));
                }
            }
            while(dq1.size() && getdpval(dq1.back()) >= getdpval(i)) dq1.pop_back();
            dq1.push_back(i);
        }
        cout << ans << "\n";
    }
}   

signed main() {
    cin.tie(0)->sync_with_stdio(false);
    int t; cin >> t;
    while(t--) solve();
    return 0;
}

/*
4 5 3
ULDDRR
*/