#include <bits/stdc++.h>
using namespace std;
void err(istream_iterator<string> it) {
  cout << '\n';
  ;
}
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
  cerr << *it << " = " << a << ", ";
  err(++it, args...);
}
template <typename T>
inline void Int(T &n) {
  n = 0;
  int f = 1;
  register int ch = getchar();
  for (; !isdigit(ch); ch = getchar())
    if (ch == '-') f = -1;
  for (; isdigit(ch); ch = getchar()) n = (n << 3) + (n << 1) + ch - '0';
  n = n * f;
}
template <typename T, typename TT>
inline void Int(T &n, TT &m) {
  Int(n);
  Int(m);
}
template <typename T, typename TT, typename TTT>
inline void Int(T &n, TT &m, TTT &l) {
  Int(n, m);
  Int(l);
}
double ind() {
  double x;
  scanf("%lf", &x);
  return x;
}
int set_1(int n, int pos) { return n = (n | (1 << pos)); }
int reset_0(int n, int pos) { return n = n & ~(1 << pos); }
bool check_bit(int n, int pos) { return n = n & (1 << pos); }
int dx[8] = {1, 0, -1, 0, -1, -1, 1, 1};
int dy[8] = {0, 1, 0, -1, -1, 1, -1, 1};
const int N = (int)1e6 + 5;
const int M = (int)1e9 + 7;
const double pi = 2 * acos(0.0);
const double eps = 1e-9;
std::vector<long long> adj[N];
long long a[N], h[N], tot[N];
void dfs(int u, int p) {
  for (int v : adj[u]) {
    if (v != p) {
      dfs(v, u);
      tot[u] += tot[v];
    }
  }
}
bool vis[N];
int happy[N];
bool check() {
  queue<int> q;
  q.push(1);
  if (h[1] > tot[1]) return false;
  if ((h[1] + tot[1]) % 2 != 0) return false;
  happy[1] = (h[1] + tot[1]) / 2;
  if (happy[1] < 0 or happy[1] > tot[1]) return false;
  vis[1] = true;
  while (!q.empty()) {
    int u = q.front();
    q.pop();
    for (int v : adj[u]) {
      if (vis[v]) continue;
      if ((h[v] + tot[v]) % 2 != 0) return false;
      long long need = (h[v] + tot[v]) / 2;
      if (need < 0 or need > tot[v]) return false;
      if (happy[u] >= need) {
        happy[v] = need;
        happy[u] -= happy[v];
      } else {
        return false;
      }
      vis[v] = true;
      q.push(v);
    }
  }
  return true;
}
int main() {
  int t = 1, te = 0;
  Int(t);
  while (t--) {
    int n, m;
    Int(n, m);
    for (int i = 1; i <= n; ++i) {
      Int(a[i]);
      tot[i] = a[i];
    }
    for (int i = 1; i <= n; ++i) {
      Int(h[i]);
    }
    for (int i = 1; i < n; ++i) {
      int u, v;
      Int(u, v);
      adj[u].push_back(v);
      adj[v].push_back(u);
    }
    dfs(1, 1);
    if (check()) {
      printf("YES\n");
    } else {
      printf("NO\n");
    }
    for (int i = 1; i <= n; ++i) {
      adj[i].clear();
      happy[i] = 0ll;
      vis[i] = false;
      tot[i] = 0ll;
    }
  }
  return 0;
}
