#include <bits/stdc++.h>
using namespace std;
int getlongestpath(int pos, int par, vector<vector<int>> &adj) {
  int mx = 1;
  for (auto thenode : adj[pos]) {
    if (thenode != par) {
      mx = max(mx, 1 + getlongestpath(thenode, pos, adj));
    }
  }
  return mx;
}
int main() {
  vector<int> iden;
  int tc;
  cin >> tc;
  while (tc--) {
    int n;
    cin >> n;
    vector<vector<int>> adj(n + 1);
    int temp, temp2;
    int nxt = n + 1;
    for (temp = 1; temp < n; temp++) {
      int x, y;
      cin >> x >> y;
      adj[x].push_back(y);
      adj[y].push_back(x);
    }
    for (temp = 1; temp <= n; temp++) {
      char c;
      cin >> c;
      if (c == 'W') {
        int a, b, c, d;
        a = temp;
        b = nxt++;
        c = nxt++;
        d = nxt++;
        for (int tmp = 0; tmp < 3; tmp++) adj.push_back(iden);
        adj[a].push_back(b);
        adj[b].push_back(a);
        adj[b].push_back(c);
        adj[c].push_back(b);
        adj[b].push_back(d);
        adj[d].push_back(b);
      }
    }
    n = nxt - 1;
    bool cek = false;
    for (int temp = 1; temp <= n; temp++)
      if (adj[temp].size() >= 4) cek = true;
    if (cek) {
      cout << "White\n";
      continue;
    }
    int degree3count = 0;
    for (int temp = 1; temp <= n; temp++) {
      if (adj[temp].size() == 3) {
        degree3count++;
        int count = 0;
        for (auto thenode : adj[temp]) count += (adj[thenode].size() >= 2);
        if (count >= 2) {
          cek = true;
          break;
        }
      }
    }
    if (cek) {
      cout << "White\n";
      continue;
    }
    if (degree3count < 2) {
      cout << "Draw\n";
      continue;
    }
    int root = 1;
    for (temp = 1; temp <= n; temp++)
      if (adj[temp].size() == 1) {
        root = temp;
        break;
      }
    int longpath = getlongestpath(root, root, adj);
    if (longpath % 2 == 1) {
      cout << "White\n";
    } else
      cout << "Draw\n";
  }
}
