#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class t, class u>
void chmax(t& first, u second) {
  if (first < second) first = second;
}
template <class t, class u>
void chmin(t& first, u second) {
  if (second < first) first = second;
}
template <class t>
using vc = vector<t>;
template <class t>
using vvc = vc<vc<t>>;
using pi = pair<ll, ll>;
using vi = vc<ll>;
template <class t, class u>
ostream& operator<<(ostream& os, const pair<t, u>& p) {
  return os << "{" << p.first << "," << p.second << "}";
}
template <class t>
ostream& operator<<(ostream& os, const vc<t>& v) {
  os << "{";
  for (auto e : v) os << e << ",";
  return os << "}";
}
using uint = unsigned;
using ull = unsigned long long;
template <class t, size_t n>
ostream& operator<<(ostream& os, const array<t, n>& first) {
  return os << vc<t>(first.begin(), first.end());
}
template <ll i, class T>
void print_tuple(ostream&, const T&) {}
template <ll i, class T, class H, class... Args>
void print_tuple(ostream& os, const T& t) {
  if (i) os << ",";
  os << get<i>(t);
  print_tuple<i + 1, T, Args...>(os, t);
}
template <class... Args>
ostream& operator<<(ostream& os, const tuple<Args...>& t) {
  os << "{";
  print_tuple<0, tuple<Args...>, Args...>(os, t);
  return os << "}";
}
void print(ll x, ll suc = 1) {
  cout << x;
  if (suc == 1) cout << "\n";
  if (suc == 2) cout << " ";
}
ll read() {
  ll i;
  cin >> i;
  return i;
}
vi readvi(ll n, ll off = 0) {
  vi v(n);
  for (ll i = ll(0); i < ll(n); i++) v[i] = read() + off;
  return v;
}
template <class T>
void print(const vector<T>& v, ll suc = 1) {
  for (ll i = ll(0); i < ll(v.size()); i++)
    print(v[i], i == ll(v.size()) - 1 ? suc : 2);
}
string readString() {
  string s;
  cin >> s;
  return s;
}
template <class T>
T sq(const T& t) {
  return t * t;
}
void yes(bool ex = true) {
  cout << "Yes" << endl;
  if (ex) exit(0);
}
void no(bool ex = true) {
  cout << "No" << endl;
  if (ex) exit(0);
}
void possible(bool ex = true) {
  cout << "Possible" << endl;
  if (ex) exit(0);
}
void impossible(bool ex = true) {
  cout << "Impossible" << endl;
  if (ex) exit(0);
}
constexpr ll ten(ll n) { return n == 0 ? 1 : ten(n - 1) * 10; }
const ll infLL = LLONG_MAX / 3;
const ll inf = infLL;
ll topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }
ll topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }
ll botbit(signed first) { return first == 0 ? 32 : __builtin_ctz(first); }
ll botbit(ll first) { return first == 0 ? 64 : __builtin_ctzll(first); }
ll popcount(signed t) { return __builtin_popcount(t); }
ll popcount(ll t) { return __builtin_popcountll(t); }
bool ispow2(ll i) { return i && (i & -i) == i; }
ll mask(ll i) { return (ll(1) << i) - 1; }
bool inc(ll first, ll second, ll c) { return first <= second && second <= c; }
template <class t>
void mkuni(vc<t>& v) {
  sort(v.begin(), v.end());
  v.erase(unique(v.begin(), v.end()), v.end());
}
ll rand_int(ll l, ll r) {
  static random_device rd;
  static mt19937_64 gen(rd());
  return uniform_int_distribution<ll>(l, r)(gen);
}
template <class t>
ll lwb(const vc<t>& v, const t& first) {
  return lower_bound(v.begin(), v.end(), first) - v.begin();
}
const ll nmax = 3010;
pi dp[nmax][nmax];
pi tmp[nmax];
ll val[nmax];
vi t[nmax];
ll dfs(ll v, ll p) {
  ll s = 0;
  dp[v][0] = pi(0, val[v]);
  for (auto c : t[v])
    if (c != p) {
      ll w = dfs(c, v);
      for (ll i = ll(w + 1) - 1; i >= ll(0); i--) {
        pi z = dp[c][i];
        if (z.second > 0) z.first++;
        z.second = 0;
        chmax(dp[c][i + 1], z);
      }
      w++;
      for (ll i = ll(0); i < ll(s + 1); i++) tmp[i] = dp[v][i];
      for (ll i = ll(0); i < ll(s + w + 1); i++) dp[v][i] = pi(-inf, -inf);
      for (ll i = ll(0); i < ll(s + 1); i++)
        for (ll j = ll(0); j < ll(w + 1); j++)
          chmax(dp[v][i + j], pi(tmp[i].first + dp[c][j].first,
                                 tmp[i].second + dp[c][j].second));
      s += w;
    }
  return s;
}
void slv() {
  ll n;
  cin >> n;
  ll m;
  cin >> m;
  for (ll i = ll(0); i < ll(n); i++) t[i] = vi();
  memset(val, 0, sizeof(val));
  for (ll i = ll(0); i < ll(n); i++)
    for (ll j = ll(0); j < ll(n); j++) dp[i][j] = pi(-inf, -inf);
  for (ll i = ll(0); i < ll(n); i++) {
    ll v;
    cin >> v;
    val[i] -= v;
  }
  for (ll i = ll(0); i < ll(n); i++) {
    ll v;
    cin >> v;
    val[i] += v;
  }
  for (ll _ = ll(0); _ < ll(n - 1); _++) {
    ll first, second;
    cin >> first >> second;
    first--;
    second--;
    t[first].push_back(second);
    t[second].push_back(first);
  }
  dfs(0, -1);
  pi ans = dp[0][m - 1];
  if (ans.second > 0) ans.first++;
  print(ans.first);
}
signed main() {
  cin.tie(0);
  ios::sync_with_stdio(0);
  cout << fixed << setprecision(20);
  ll ts;
  cin >> ts;
  for (ll _ = ll(0); _ < ll(ts); _++) slv();
}
