#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define Inf 1000000001

int op(int a,int b){
	return max(a,b);
}
int opm(int a,int b){
	return min(a,b);
}
int em(){
	return Inf;
}

int e(){
	return 0;
}
int solve(){
	int n;
	cin>>n;
	vector<int> a(n),b(n);
	vector<pair<int,int>> p(n);
	rep(i,n){
		cin>>a[i];
	}
	rep(i,n){
		cin>>b[i];
		p[i] = make_pair(b[i],i);
	}
	
	segtree<int,op,e> seg(a);
	segtree<int,opm,em> segm(n);
	
	sort(p.begin(),p.end());
	
	rep(i,n){
		int ind = p[i].second;
		//cout<<ind<<endl;
		if(seg.get(ind)>b[ind]){
			cout<<"No"<<endl;
			return 0;
		}
		int ok = ind+1,ng = n+1;
		while(ng-ok>1){
			int mid = (ok+ng)/2;
			if(seg.prod(ind,mid)>b[ind] || segm.prod(ind,mid)<b[ind])ng = mid;
			else ok = mid;
		}
		if(seg.prod(ind,ok)==b[ind]){

			seg.set(ind,b[ind]);
			segm.set(ind,b[ind]);
			continue;
		}
		ok = ind+1,ng = -1;
		while(ok-ng>1){
			int mid = (ok+ng)/2;
			if(seg.prod(mid,ind+1)>b[ind] || segm.prod(mid,ind+1)<b[ind])ng = mid;
			else ok = mid;
		}
		/*
		cout<<ok<<','<<ind+1<<','<<seg.prod(ok,ind+1)<<endl;
		rep(j,n){
			cout<<seg.get(j)<<',';
		}
		cout<<endl;*/
		if(seg.prod(ok,ind+1)==b[ind]){
			seg.set(ind,b[ind]);
			segm.set(ind,b[ind]);
			continue;
		}
		cout<<"No"<<endl;
		return 0;
	}
	
	cout<<"Yes"<<endl;
	return 0;
}

int main(){
	
	int _t;
	cin>>_t;
	rep(_,_t){
		solve();
	}
	
	return 0;
}