#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)
template<typename T>
void amin(T &a, T b) {
a = min(a,b);
}
template<typename T>
void amax(T &a, T b) {
a = max(a,b);
}
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif
/*
*/
const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
struct DSU {
vector<int> par, rankk;
vector<int> good;
vector<array<int,4>> history;
DSU() {
}
DSU(int n) {
init(n);
}
void init(int n) {
par = vector<int>(n + 1);
rankk = vector<int>(n + 1);
good = vector<int>(n + 1);
rep(i, n + 1) create(i);
}
void create(int u) {
par[u] = u;
rankk[u] = 0;
}
int find(int u) {
if (u == par[u]) return u;
else return find(par[u]);
}
bool same(int u, int v) {
return find(u) == find(v);
}
void merge(int u, int v, int id) {
u = find(u), v = find(v);
if (u == v) return;
history.pb({id,u,par[u],rankk[u]});
history.pb({id,v,par[v],rankk[v]});
if (rankk[u] == rankk[v]) rankk[u]++;
if (rankk[u] < rankk[v]) swap(u, v);
par[v] = u;
}
void rollback(int id){
while(!history.empty()){
auto [idd,u,pu,rnku] = history.back();
if(idd != id) break;
history.pop_back();
par[u] = pu;
rankk[u] = rnku;
}
}
};
void solve(int test_case)
{
ll n,m; cin >> n >> m;
vector<ll> a(n+5), b(n+5);
rep1(i,n) cin >> a[i];
rep1(i,n) cin >> b[i];
vector<pll> edges(m+5);
rep1(i,m) cin >> edges[i].ff >> edges[i].ss;
vector<pll> edge_range(m+5);
rep1(i,m){
auto [u,v] = edges[i];
int l1 = b[u], r1 = a[u];
int l2 = b[v], r2 = a[v];
int l3 = max(l1,l2), r3 = min(r1,r2);
edge_range[i] = {l3,r3};
}
vector<vector<ll>> ax(n+5), bx(n+5);
rep1(i,n) ax[a[i]].pb(i), bx[b[i]].pb(i);
ll ans = 1;
DSU dsu(n);
ll ptr = 1;
auto go = [&](vector<ll> &edge_ids, ll l, ll r, auto &&go) -> void{
if(l > r) return;
ll mid = (l+r) >> 1;
// x in [l,mid]
vector<ll> nxt;
ll curr_ptr = ptr++;
trav(id,edge_ids){
auto [u,v] = edges[id];
auto [lx,rx] = edge_range[id];
if(lx > mid or rx < l) conts;
if(lx <= l and rx >= mid){
dsu.merge(u,v,curr_ptr);
}
else{
nxt.pb(id);
}
}
if(l != mid){
go(nxt,l,mid,go);
}
else{
// calc ans for x = mid
trav(i,ax[mid]){
dsu.good[dsu.find(i)] = 1;
}
trav(i,bx[mid]){
ll p = dsu.find(i);
ans &= dsu.good[p];
}
trav(i,ax[mid]){
dsu.good[dsu.find(i)] = 0;
}
}
dsu.rollback(curr_ptr);
// x in [mid+1,r]
nxt.clear();
curr_ptr = ptr++;
trav(id,edge_ids){
auto [u,v] = edges[id];
auto [lx,rx] = edge_range[id];
if(lx > r or rx < mid+1) conts;
if(lx <= mid+1 and rx >= r){
dsu.merge(u,v,curr_ptr);
}
else{
nxt.pb(id);
}
}
go(nxt,mid+1,r,go);
dsu.rollback(curr_ptr);
};
vector<ll> edge_ids;
rep1(i,m){
if(edge_range[i].ff <= edge_range[i].ss){
edge_ids.pb(i);
}
}
go(edge_ids,1,n,go);
cout << ans << endl;
/*
rev(x,n,1){
DSU dsu(n);
rep1(i,m){
auto [l,r] = edge_range[i];
if(l <= x and x <= r){
auto [u,v] = edges[i];
dsu.merge(u,v);
}
}
rep1(i,n){
if(a[i] == x){
dsu.good[dsu.find(i)] = 1;
}
}
rep1(i,n){
if(b[i] == x){
ll p = dsu.find(i);
ans &= dsu.good[p];
}
}
}
cout << ans << endl;
*/
}
int main()
{
fastio;
int t = 1;
cin >> t;
rep1(i, t) {
solve(i);
}
return 0;
}
