#include <bits/stdc++.h>
using namespace std;
//loops (warning : long long)
#define FOR(i, l, r) for(int i = (l); i < (r); ++i)
#define ROF(i, r, l) for(int i = (r - 1); i >= l; --i)
//pairs, tuples
#define mp make_pair
#define mt make_tuple
#define ff first
#define ss second
//vectors
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
#define pb push_back
#define eb emplace_back
#define sum_of(v) accumulate(all(v), 0ll)
#define sz(v) (int)v.size()
#define compact(v) v.erase(unique(all(v)), end(v))
//binary search
#define lwb lower_bound
#define upb upper_bound
//other stuffs
#define dbg(x) "[" #x " = " << (x) << "]"
#define file(task) if(fopen(task".inp", "r")){ freopen(task".inp", "r", stdin); freopen(task".out", "w", stdout); }
template<typename T>
bool minimize(T& a, const T& b){
if(a > b) return a = b, true;
return false;
}
template<typename T>
bool maximize(T& a, const T& b){
if(a < b) return a = b, true;
return false;
}
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using db = double;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vpi = vector<pi>;
using vpl = vector<pl>;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MAX = 2e5 + 5;
struct DSU_Rollback{
vi lab;
stack<tuple<int, int, int, int>> st;
DSU_Rollback(int n) : lab(n, -1), st() {}
int root(int u){
return lab[u] < 0 ? u : (root(lab[u]));
}
bool join(int u, int v){
u = root(u); v = root(v);
if(u == v) return false;
st.push(mt(u, lab[u], v, lab[v]));
lab[u] += lab[v];
lab[v] = u;
return true;
}
int snapshot(){ return sz(st); }
void rollback(int old){
assert(old <= snapshot());
while(old != snapshot()){
int u, lu, v, lv;
tie(u, lu, v, lv) = st.top(); st.pop();
lab[u] = lu;
lab[v] = lv;
}
}
};
void testcase(int ntestcase){
int N, M;
cin >> N >> M;
vi a(N), b(M);
FOR(i, 0, N) cin >> a[i], --a[i];
FOR(i, 0, N) cin >> b[i], --b[i];
vpi e(M);
vector<vi> need(N), have(N), blocks(4 * N);
FOR(i, 0, N){
have[a[i]].emplace_back(i);
need[b[i]].emplace_back(i);
}
auto add = [&](auto self, int id, int l, int r, int u, int v, int x) -> void{
if(u <= l && r <= v) blocks[id].eb(x);
else{
int mid = l + r >> 1;
if(u <= mid) self(self, id << 1, l, mid, u, v, x);
if(mid < v) self(self, id << 1 | 1, mid + 1, r, u, v, x);
}
};
FOR(i, 0, M){
int u, v;
cin >> u >> v;
--u, --v;
e[i] = mp(u, v);
int l = max(b[u], b[v]);
int r = min(a[u], a[v]);
if(l <= r){
add(add, 1, 0, N - 1, l, r, i);
}
}
DSU_Rollback dsu(N);
auto solve = [&](auto& self, int id, int l, int r) -> bool{
int old = dsu.snapshot();
for(auto i : blocks[id]){
dsu.join(e[i].ff, e[i].ss);
}
if(l == r){
vi comps;
for(auto u : have[l]) comps.eb(dsu.root(u));
sort(all(comps));
for(auto u : need[l]){
if(!binary_search(all(comps), dsu.root(u))){
return false;
}
}
} else{
int mid = l + r >> 1;
if(!self(self, id << 1, l, mid)) return false;
if(!self(self, id << 1 | 1, mid + 1, r)) return false;
}
dsu.rollback(old);
return true;
};
cout << solve(solve, 1, 0, N - 1) << '\n';
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
#ifdef LOCAL
file("task");
#endif // LOCAL
int T = 1;
cin >> T;
FOR(i, 0, T) testcase(i);
return 0;
}
