#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 110;

int dp[N];
int p[N], m[N];
int n, k;

int fun(int n, int k)
{
    memset(dp, 0, sizeof dp);

    dp[0] = p[0];

    int res = p[0];//最大值可能就在p[0],于是令res = p[0]

    for(int i = 1; i < n; i ++)
    {
        dp[i] = p[i];

        for (int j = 0; j < i; j ++ )
        {
            if(m[i] - m[j] > k)//当前餐馆与前一个参观大于规定距离
                dp[i] = max(dp[i], dp[j] + p[i]);
        }

        res = max(res, dp[i]);//更新最大利润
    }

    return res;
}

int main()
{
    int t;
    cin >> t;

    while(t --)
    {
        cin >> n >> k;

        for (int i = 0; i < n; i ++ )
        cin >> m[i];

        for (int i = 0; i < n; i ++ )
        cin >> p[i];

        cout << fun(n, k) << endl;
    }
}