#pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include <bits/stdc++.h> using namespace std; #define ll long long #define pi pair<int,int> #define vi vector<int> #define pb push_back #define all(a) a.begin(),a.end() const int mxn = 150001; int par[mxn], mn[mxn]; int cola[mxn], colb[mxn]; vector<array<int,3>> history; vector<pi> edges[1<<19]; vector<int> qu[mxn]; int edge[200000][2]; int find(int u){ if(par[u]<0) return u; return find(par[u]); } bool merge(int u, int v){ u = find(u), v = find(v); if(u==v) return false; if(par[u]>par[v]) swap(u,v); history.push_back({v,par[v],mn[u]}); par[u]+=par[v]; par[v]=u; mn[u] = min(mn[u],mn[v]); return true; } bool ans = 1; void update(int i, int l, int r, int s, int e, pi ed){ if(r < s || l > e) return; if(s <= l && r <= e){ edges[i].pb(ed); return; } int m = (l+r)>>1; update(i<<1,l,m,s,e,ed); update(i<<1|1,m+1,r,s,e,ed); } void dfs(int i, int l, int r){ int snapshot = history.size(); for(auto [u,v] : edges[i]) merge(u,v); edges[i].clear(); if(l==r){ for(auto u : qu[l]) ans &= (mn[find(u)]==l); qu[l].clear(); }else{ int m = (l+r)>>1; dfs(i<<1,l,m); dfs(i<<1|1,m+1,r); } for(; history.size() > snapshot; ){ auto [u,a,m1] = history.back(); history.pop_back(); mn[par[u]] = m1; par[par[u]] -= a; par[u] = a; } } void solve(){ int n,m; cin >> n >> m; fill(par+1,par+n+1,-1); for(int i = 1; i <= n; i++) cin >> cola[i]; for(int i = 1; i <= n; i++) cin >> colb[i]; for(int i = 0; i < m; i++) cin >> edge[i][0] >> edge[i][1]; for(int i = 1; i <= n; i++){ if(cola[i] < colb[i]){ cout << "0\n"; return; } qu[colb[i]].push_back(i); mn[i] = cola[i]; } for(int i = 0; i < m; i++){ int l = max(colb[edge[i][0]],colb[edge[i][1]]); int r = min(cola[edge[i][0]],cola[edge[i][1]]); if(l <= r) update(1,1,n,l,r,{edge[i][0],edge[i][1]}); } ans = 1; dfs(1,1,n); cout << ans << '\n'; } signed main(){ cin.tie(0)->sync_with_stdio(0); int t = 1; cin >> t; for(int i = 0; i < t; i++){solve();} }