#include <bits/stdc++.h>
using namespace std;
int T, n;
vector<int> s[1234567];
char col[1234567];
int js() {
  for (int i = 1; i <= n; ++i)
    if (col[i] == 'W') {
      int ans = 0;
      for (auto g : s[i]) ans += col[g] == 'W';
      if (ans >= 2) return 1;
    }
  for (int i = 1; i <= n; ++i)
    if (col[i] == 'B') {
      int ans = 0;
      for (auto g : s[i]) ans += col[g] == 'B';
      if (ans >= 2) return -1;
    }
  return 0;
}
bool brute(int cur) {
  int w = js();
  if (w == 1) return 1;
  if (w == -1) return 0;
  bool poss = 0;
  for (int i = 1; i <= n; ++i)
    if (col[i] == 'N') {
      poss = 1;
      if (!cur) {
        col[i] = 'W';
        if (brute(!cur)) {
          col[i] = 'N';
          return 1;
        }
        col[i] = 'N';
      } else {
        col[i] = 'B';
        if (!brute(!cur)) {
          col[i] = 'N';
          return 0;
        }
        col[i] = 'N';
      }
    }
  if (!poss) return 0;
  return cur;
}
int dep[1234567];
void dfs(int x, int fa = 0) {
  dep[x] = dep[fa] + 1;
  for (auto b : s[x])
    if (b != fa) dfs(b, x);
}
bool sol() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) s[i].clear();
  for (int i = 1, a, b; i < n; ++i)
    scanf("%d%d", &a, &b), s[a].push_back(b), s[b].push_back(a);
  scanf("%s", col + 1);
  if (n <= 5) return brute(0);
  for (int i = 1; i <= n; ++i)
    if (s[i].size() >= 4) return 1;
  for (int i = 1; i <= n; ++i)
    if (s[i].size() == 3) {
      int c2 = 0;
      for (auto g : s[i]) c2 += s[g].size() > 1;
      if (c2 >= 2) return 1;
    }
  for (int i = 1; i <= n; ++i)
    if (col[i] == 'W') {
      if (s[i].size() > 1) return 1;
      int g = s[i].front();
      if (s[g].size() >= 3) return 1;
    }
  dfs(1);
  int g[2] = {0, 0};
  for (int i = 1; i <= n; ++i)
    if (col[i] == 'W') g[dep[i] & 1]++;
  for (int i = 1; i <= n; ++i)
    if (s[i].size() == 3) g[!(dep[i] & 1)]++;
  if (g[0] > 1 || g[1] > 1) return 1;
  return 0;
}
int main() {
  scanf("%d", &T);
  while (T--)
    if (sol())
      puts("White");
    else
      puts("Draw");
}
