#include<bits/stdc++.h>
#define AC return 0;
#define int long long 
#define pii pair<int,int>
#define all(tar) tar.begian(),tar.end()
const int maxx=2e5+5;
const int mod=998244353; 
using namespace std;
int n,m,t;
int a[maxx];
int pre[maxx];
int be[maxx];
string s;
int st[maxx];
int dppre[maxx],dpbe[maxx];
int sum=0;
signed main(){
   ios::sync_with_stdio(false);
   cin.tie(0);
   cout.tie(0);
   cin>>t;
   while(t--){
      cin>>n>>m;
      for(int i=1;i<=n;i++)cin>>a[i];
      cin>>s;
      s="1"+s+"1";
      int head=0,tail=1,sum=0;
      st[++head]=0;
      be[n+1]=pre[0]=0;
      for(int i=1;i<=n;i++){
         if(s[i]=='1')sum+=a[i];
      }
      for(int i=1;i<=n+1;i++){
          while(head<=tail&&i-st[head]>m){
             ++head;
          }
          pre[i]=pre[st[head]];
          if(s[i]=='0')pre[i]+=a[i];
          while(head<=tail&&pre[i]<=pre[st[tail]])--tail;
          st[++tail]=i;
      }
      head=0,tail=1;
      st[++head]=n+1;
      for(int i=n;i>=0;i--){
         while(head<tail&&st[head]-i>m)++head;
         be[i]=be[st[head]];
         if(s[i]=='0')be[i]+=a[i];
         while(head<=tail&&be[i]<=be[st[tail]])--tail;
         st[++tail]=i;
      }
      int q;
      cin>>q;
      while(q--){
         int pos,v;
         cin>>pos>>v;
         if(s[pos]=='0'){  
            swap(v,a[pos]);
         }else {
           sum-=a[pos];
           sum+=v;
         }
         int l=max(0ll,pos-2*m-1);
         int r=min(n+1,pos+2*m+1);
         head=0,tail=1;
         st[++head]=l;
         dppre[l]=pre[l];
         for(int i=l+1;i<=r;i++){
            while(head<=tail&&i-st[head]>m){
               ++head;
            }
            dppre[i]=dppre[st[head]];
            if(s[i]=='0')dppre[i]+=a[i];
            while(head<=tail&&dppre[i]<=dppre[st[tail]])--tail;
            st[++tail]=i;
        }
        dpbe[r]=be[r];
        head=0,tail=1;
        st[++head]=r;
         for(int i=r-1;i>=l;i--){
            while(head<tail&&st[head]-i>m)++head;
            dpbe[i]=dpbe[st[head]];
            if(s[i]=='0')dpbe[i]+=a[i];
            while(head<=tail&&dpbe[i]<=dpbe[st[tail]])--tail;
            st[++tail]=i;
         }
         int ans=1e18;
         for(int i=l;i<=r;i++){
           ans=min(ans,dppre[i]+dpbe[i]-a[i]*((s[i]-'0')^1)+sum);
         }
         cout<<ans<<'\n';
         if(s[pos]=='0'){  
            swap(v,a[pos]);
            continue;
         }else {
           sum+=a[pos];
           sum-=v;
         }
      }
   }
   AC
}