#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const int N = 200000;
int A[N+5];
int B[N+5];
struct DSU{
int n;
int par[N+5];
int sz[N+5];
struct operacija{
int a, b, sza, szb;
};
stack <operacija> st;
void init(int _n){
n = _n;
for(int i=1; i<=n; i++) par[i] = i;
for(int i=1; i<=n; i++) sz[i] = 1;
}
int root(int x){ return (x == par[x] ? x : root(par[x])); }
void povezi(int a, int b){
a = root(a);
b = root(b);
if(sz[a] < sz[b]) swap(a, b);
st.push({a, b, sz[a], sz[b]});
if(a == b) return;
sz[a] += sz[b];
par[b] = a;
}
void rollback(){
int a = st.top().a;
int b = st.top().b;
sz[a] = st.top().sza;
sz[b] = st.top().szb;
par[b] = b;
st.pop();
}
};
vector <int> koji[N+5];
vector <int> treba[N+5];
vector <pair <int, int>> edges;
vector <pair <int, int>> zivi[4*N+5];
void klear(int n){
for(int i=1; i<=n; i++) koji[A[i]].clear();
for(int i=1; i<=n; i++) treba[B[i]].clear();
for(int i=1; i<=4*n; i++) zivi[i].clear();
edges.clear();
}
map <int, bool> ima;
void upd(int node, int l, int r, int tl, int tr, pair <int, int> edge){
if(tl > r || l > tr) return;
if(tl <= l && r <= tr){
zivi[node].push_back(edge);
return;
}
int mid = (l+r)/2;
upd(node*2, l, mid, tl, tr, edge);
upd(node*2+1, mid+1, r, tl, tr, edge);
}
DSU dsu;
bool dfs(int node, int l, int r){
for(auto c : zivi[node]) dsu.povezi(c.first, c.second);
if(l == r){
bool svi = 1;
ima.clear();
for(auto c : koji[l]) ima[dsu.root(c)] = 1;
for(auto c : treba[l]) svi &= ima[dsu.root(c)];
for(auto c : zivi[node]) dsu.rollback();
return svi;
}
int mid = (l+r)/2;
bool moze = (dfs(node*2, l, mid));
if(moze) moze &= dfs(node*2+1, mid+1, r);
for(auto c : zivi[node]) dsu.rollback();
return moze;
}
void solve(){
int n, m;
cin >> n >> m;
for(int i=1; i<=n; i++) cin >> A[i];
for(int i=1; i<=n; i++) cin >> B[i];
for(int i=1; i<=n; i++) koji[A[i]].push_back(i);
for(int i=1; i<=n; i++) treba[B[i]].push_back(i);
for(int i=1; i<=m; i++){
int a, b;
cin >> a >> b;
edges.push_back({a, b});
}
for(int i=1; i<=n; i++){
if(A[i] < B[i]){
cout << "0\n";
klear(n);
return;
}
}
for(auto edge : edges){
int a = edge.first;
int b = edge.second;
int l = max(B[a], B[b]);
int r = min(A[a], A[b]);
if(l <= r) upd(1, 1, n, l, r, {a, b});
}
dsu.init(n);
if(dfs(1, 1, n)) cout << "1\n";
else cout << "0\n";
klear(n);
return;
}
int main(){
ios_base::sync_with_stdio(false), cin.tie(0);
cout.precision(10);
cout << fixed;
int t;
cin >> t;
while(t--) solve();
return 0;
}
