//Mashiro
#include<bits/stdc++.h>

#define vc vector
#define db double
#define fi first
#define se second
#define ll long long
#define mk make_pair
#define pb push_back
#define RI register int
#define PI pair<int,int>
#define ull unsigned long long
#define err cerr << "   -_-   " << endl
#define debug cerr << " ------------------- " << endl

#define input(x) freopen(#x".in","r",stdin)
#define output(x) freopen(#x".out","w",stdout)

#define NO puts("No")
#define YES puts("Yes")

//#define OccDreamer
//#define int long long

using namespace std;

namespace IO{
	inline ll read(){
		ll X=0, W=0; char ch=getchar();
		while(!isdigit(ch)) W|=ch=='-', ch=getchar();
		while(isdigit(ch)) X=(X<<1)+(X<<3)+(ch^48), ch=getchar();
		return W?-X:X;
	}
	inline void write(ll x){
		if(x<0) x=-x, putchar('-');
		if(x>9) write(x/10);
		putchar(x%10+'0');
	}
	inline void sprint(ll x){write(x), putchar(31);}
	inline void eprint(ll x){write(x), putchar(10);}
}using namespace IO;

const int MAXN = 1e5 + 6;
const int mod = 1e9 + 7;

int n, m, a[MAXN];
int now[MAXN], b[MAXN];

bool mark[MAXN]; 

inline int solve(){
	memset(now,0,sizeof now);
	memset(mark,0,sizeof mark);
	int ans=0;
	for(int i=1;i<=n;++i){
		if(a[i]==0) now[b[i]]++;
		else{
			if(now[b[i]]>0){
				now[b[i]]--;
				mark[i]=1; ++ans;
			}
		}
	}
	memset(now,0,sizeof now);
	for(int i=n;i>=1;--i){
		if(a[i]==1) now[b[i]]++;
		else{
			if(now[b[i]]>0){
				now[b[i]]--;
				mark[i]=1;
			}
		}
	}
	int cur=0;
	for(int i=1;i<=n;++i){
		if(mark[i]) continue;
		if(a[i]==0){
			cur++; 
		}
		else{
			if(cur) cur--, ans++;
		}
	}
	return ans;
}

int main(){
//  freopen("bracket.in","r",stdin);
//  freopen("bracket.out","w",stdout);
	n=read(), m=read(); int all=0;
  for(int i=1;i<=n;++i) b[i]=read();
  for(int i=1;i<=n;++i) a[i]=read();
	eprint(solve());
	while(m--){
		int x, p, q;
		x=read(), q=read(), p=read();
		a[x]=p; b[x]=q; eprint(solve()); 
	}
	return 0;
}
/*
10 10
2 1 2 2 2 2 1 2 2 2
1 1 0 0 0 0 1 0 0 0
3 2 0
5 1 0
9 1 1
4 2 1
8 1 1
2 1 0
1 2 1
8 2 0
1 1 1
9 1 0
*/