//μ's forever
#include <bits/stdc++.h>
#define N 105
//#define getchar nc
using namespace std;
inline char nc(){
    static char buf[100000],*p1=buf,*p2=buf;
    return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
inline int read()
{
    register int x=0,f=1;register char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9')x=(x<<3)+(x<<1)+ch-'0',ch=getchar();
    return x*f;
}
inline void write(register int x)
{
    if(!x)putchar('0');if(x<0)x=-x,putchar('-');
    static int sta[20];register int tot=0;
    while(x)sta[tot++]=x%10,x/=10;
    while(tot)putchar(sta[--tot]+48);
}
int T,n;
int a[N],b[N];
map<int,int> mp;
int main()
{
    T=read();
    while(T--){
        n=read();
        for(int i=1;i<=n;++i) a[i]=read();
        for(int i=1;i<=n;++i) b[i]=read();
        if(n==1||n==2){
            puts("Yes");
            continue;
        }
        bool fl=1;
        int sm=0;
        for(int i=1;i<=n;++i) sm+=b[i];
        for(int i=1;i<=n;++i)
            for(int j=1;j<=n;++j)
                if(a[i]>a[j]){
                    if(a[j]+sm-b[j]>a[i])
                        fl=0;
                }
        mp.clear();
        for(int i=1;i<=n&&fl;++i){
            if(sm-b[i]>0){
                // cerr<<i<<endl;
                if(mp[a[i]]) fl=0;
                else mp[a[i]]=1;
            }
        }
        puts(fl?"Yes":"No");
    }
    return 0;
}