// Arup Guha
// 4/26/2019
// Solution to 2019 FHSPS Playoff Problem: Super Pawn

import java.util.*;
import java.io.*;

public class superpawn {

	public static void main(String[] args) throws Exception {
		
		BufferedReader stdin = new BufferedReader(new InputStreamReader(System.in));
		int numCases = Integer.parseInt(stdin.readLine().trim());
		
		// Process each case.
		for (int loop=0; loop<numCases; loop++) {
			
			// Get case - just need to store the differences between corresponding pawns.
			int n = Integer.parseInt(stdin.readLine().trim());
			int[] diff = new int[n];
			
			// Get top row.
			StringTokenizer tok = new StringTokenizer(stdin.readLine());
			for (int i=0; i<n; i++)
				diff[i] = Integer.parseInt(tok.nextToken());
			
			// We store the difference between the current row and the previous row,
			// for each column, minus 1 to account for how far we can move.
			tok = new StringTokenizer(stdin.readLine());
			for (int i=0; i<n; i++)
				diff[i] = Integer.parseInt(tok.nextToken()) - diff[i] - 1;
			
			// This game is exactly equivalent to NIM. Moving a piece forward k steps is like
			// taking k stones from a single pile in NIM. If a team moves backwards, the 
			// opponent could just move forwards the same amount, returning the state of the game
			// to where it was before the original move.
			int xor = 0;
			for (int i=0; i<n; i++)
				xor ^= diff[i];
			
			// In NIM, the team going first can win iff the xor is not 0.
			if (xor != 0)
				System.out.println("WHITE");
			else
				System.out.println("BLACK");
		}
	}
}