// Cheese-Cracker: cheese-cracker.github.io

void solve(){
    long n = scan;
    auto a = scanArray!int;
    auto b = scanArray!int;
    auto freqa = new ll[301];
    auto freqb = new ll[301];
    auto cache = new ll[301];
    for(int i = 0; i < n; ++i){
        ++freqa[a[i] + 100];
        ++freqb[b[i] + 100];
    }
    for(int i = 0; i <= 200; ++i){
        ll take = min(freqb[i], cache[i]);
        cache[i] -= take;
        ll left = freqb[i] - take;
        freqa[i] -= left;
        if(freqa[i] < 0){
            writeln("NO");
            return;
        }
        cache[i+1] += freqa[i];
        freqa[i] = 0;
    }
    writeln("YES");
}

void main(){
    long tests = scan;        // Toggle!
    while(tests--) solve;
}

/**************    *****    That's All Folks!    *****    **************/
import std.stdio, std.range, std.conv, std.typecons, std.algorithm, std.container, std.math;
string[] tk; T scan(T=long)(){while(!tk.length)tk = readln.split; string a=tk.front; tk.popFront; return a.to!T;}
T[] scanArray(T=long)(){ auto r = readln.split.to!(T[]); return r; }
void show(A...)(A a){ debug{ foreach(t; a){stderr.write(t, "| ");} stderr.writeln; } }
alias ll = long, tup = Tuple!(long, "x",  long, "y");
