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

void solve() {
    int n, k; cin >> n >> k;
    int a[n] = {};
    for (int i = 0; i < n; i++)
        cin >> a[i];
    int w[k] = {};
    for (int i = 0; i < k; i++)
        cin >> w[i];
    sort(a, a + n);
    sort(w, w + k, greater<int>());
    ll ans = 0;
    int l = 0, r = n - k;
    for (int i = 0; i < k; i++) {
        if (w[i] == 1) {
            ans += a[r] + a[r];
            ++r;
        } else {
            ans += a[l++] + a[r++];
            l += w[i] - 2; //跳过的较小值
        }
    }
    cout << ans << "\n";
}

int main() {
    int t; cin >> t;
    while (t--) solve();
}