#include <bits/stdc++.h>
#define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
#define fb(i,a,b) for(int (i) = (a); (i) >= (b); --(i))
#define pb push_back
#define pii pair<int,int>
#define xx first
#define yy second
using namespace std;
int n,m;
int a[150005];
int b[150005];
vector<int> x[150005];
vector<int> y[150005];
vector<pii> edges;
int dsu[150005];
int sajz[150005];
struct op{
int a,b,sza,szb;
};
stack<op> stk;
int finddsu(int x){
if(dsu[x] == x)return x;
return finddsu(dsu[x]);
}
void spoji(int a, int b){
a = finddsu(a);
b = finddsu(b);
if(sajz[a] < sajz[b])swap(a, b);
stk.push({a, b, sajz[a], sajz[b]});
if(a == b)return;
dsu[b] = dsu[a];
sajz[a] += sajz[b];
}
void rollback(){
op lst = stk.top();
stk.pop();
dsu[lst.a] = lst.a;
dsu[lst.b] = lst.b;
sajz[lst.a] = lst.sza;
sajz[lst.b] = lst.szb;
}
vector<pii> st[5000005];
void klir(){
edges.clear();
ff(i,1,n){
// graf[i].clear();
x[i].clear();
y[i].clear();
}
ff(i,1,4*n)st[i].clear();
}
void update(int node, int l, int r, int ll, int rr, pii edge){
if(l > r || l > rr || r < ll)return;
if(ll <= l && r <= rr){
st[node].pb(edge);
return;
}
int mid = (l + r) / 2;
update(node * 2, l, mid, ll, rr, edge);
update(node * 2 + 1, mid + 1, r, ll, rr, edge);
}
bool ok;
void dfs(int node, int l, int r){
for(auto c : st[node])spoji(c.xx, c.yy);
if(l == r){
map<int, bool> mapa;
for(auto c : x[l])mapa[finddsu(c)] = true;
for(auto c : y[l]){
if(!mapa[finddsu(c)])ok = false;
}
}
else{
int mid = (l + r) / 2;
dfs(node * 2, l, mid);
dfs(node * 2 + 1, mid + 1, r);
}
for(auto c : st[node])rollback();
}
void solve(){
cin >> n >> m;
ff(i,1,n)dsu[i] = i, sajz[i] = 1;
ff(i,1,n)cin >> a[i];
ff(i,1,n)cin >> b[i];
ff(i,1,m){
int u,v;
cin >> u >> v;
// graf[u].pb(v);
// graf[v].pb(u);
edges.pb({u,v});
}
ff(i,1,n)x[a[i]].pb(i);
ff(i,1,n)y[b[i]].pb(i);
ff(i,1,n){
if(a[i] < b[i]){
klir();
cout << "0\n";
return;
}
}
for(auto x:edges){
int u = x.xx;
int v = x.yy;
int A = max(b[u], b[v]);
int B = min(a[u], a[v]);
if(A <= B)update(1, 1, n, A, B, x); // mogu da koristim granu!!!
}
ok = true;
dfs(1, 1, n);
cout << ok << "\n";
klir();
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
int t;
cin >> t;
while(t--)solve();
return 0;
}
