write a go solution for Description:
Boris thinks that chess is a tedious game. So he left his tournament early and went to a barber shop as his hair was a bit messy.

His current hair can be described by an array a_1,a_2,ldots,a_n, where a_i is the height of the hair standing at position i. His desired haircut can be described by an array b_1,b_2,ldots,b_n in a similar fashion.

The barber has m razors. Each has its own size and can be used at most once. In one operation, he chooses a razor and cuts a segment of Boris's hair. More formally, an operation is:

- Choose any razor which hasn't been used before, let its size be x;
- Choose a segment [l,r] (1<=l<=r<=n);
- Set a_i:=min(a_i,x) for each l<=i<=r;

Notice that some razors might have equal sizes — the barber can choose some size x only as many times as the number of razors with size x.

He may perform as many operations as he wants, as long as any razor is used at most once and a_i=b_i for each 1<=i<=n at the end. He does not have to use all razors.

Can you determine whether the barber can give Boris his desired haircut?

Input Format:
Each test contains multiple test cases. The first line contains the number of test cases t (1<=qt<=q20,000). The description of the test cases follows.

The first line of each test case contains a positive integer n (3<=n<=2*10^5) — the length of arrays a and b.

The second line of each test case contains n positive integers a_1,a_2,ldots,a_n (1<=a_i<=10^9)  — Boris's current hair.

The third line of each test case contains n positive integers b_1,b_2,ldots,b_n (1<=b_i<=10^9)  — Boris's desired hair.

The fourth line of each test case contains a positive integer m (1<=m<=2*10^5)  — the number of razors.

The fifth line of each test case contains m positive integers x_1,x_2,ldots,x_m (1<=x_i<=10^9)  — the sizes of the razors.

It is guaranteed that the sum of n and the sum of m over all test cases do not exceed 2*10^5.

Output Format:
For each test case, print "YES" if the barber can cut Boris's hair as desired. Otherwise, print "NO".

You can output the answer in any case (upper or lower). For example, the strings "yEs", "yes", "Yes", and "YES" will be recognized as positive responses.

Note:
In the first test case, Boris's hair is initially [3,3,3]. Let us describe a sequence of 2 operations the barber can perform:

- The barber uses the razor with size 1 on the segment [2,2]; hence Boris's hair becomes [3,1,3].
- The barber uses the razor with size 2 on the segment [1,3]; hence Boris's hair becomes [2,1,2] which is the desired haircut.

In the third test case, no operation has to be done since Boris's hair is already as desired.

In the fourth test case, no cuts will be able to increase the third element in [1,1,1] in a way that the array becomes [1,1,2].. Output only the code with no comments, explanation, or additional text.