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

#define int long long

const int N=3e5+1e3+7;

int T,n,a[N],l[N],r[N],c,f[N];

int mg[N][21],g[N],mf[N][21];

int qf(int l,int r)
{
    int k=__lg(r-l+1);
    return min(mf[l][k],mf[r-(1<<k)+1][k]);
}

int qg(int l,int r)
{
    int k=__lg(r-l+1);
    return max(mg[l][k],mg[r-(1<<k)+1][k]);
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin>>T;
    while(T--)
    {
        cin>>n>>c;
        for(int i=1;i<=n;i++)
            cin>>l[i];
        for(int i=1;i<=n;i++)
            cin>>r[i];
        for(int i=1;i<=n;i++)
            cin>>a[i];
        multiset<int> ms;
        for(int i=n;i>=1;i--)
        {
            f[i]=-1e18;
            int L=i+l[i];
            if(i+r[i]>n)
                f[i]=0;
            if(L<=n)
            {
                if(L-(i+1)<c)
                    f[i]=max(f[i],qf(i+1,L));
                int R=min(i+r[i],n);
                L=i+1+c;
                if(L<=R)
                    f[i]=max(f[i],qg(L,R));
            }
            mf[i][0]=f[i]+a[i];
            for(int j=1;i+(1<<j)-1<=n;j++)
                mf[i][j]=min(mf[i][j-1],mf[i+(1<<(j-1))][j-1]);
            if(i+c<=n)
            {
                int p=i+c;
                mg[p][0]=qf(i,p);
                for(int j=1;p+(1<<j)-1<=n;j++)
                    mg[p][j]=max(mg[p][j-1],mg[p+(1<<(j-1))][j-1]);
            }
        }
        cout<<f[1]<<"\n";
    }
}