#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<unordered_map> 
#define N 200005
#define int long long
#define ul unsigned long long
#define db double
#define fo(i,l,r) for(int i=l;i<=r;i++)
#define rf(i,r,l) for(int i=r;i>=l;i--)
using namespace std;
int n,m,k,h[N],cnt,a[N],f[N],ans,x,y,z;
struct edge{int v,n;}e[N<<1];
void ad(int u,int v){e[++cnt]={v,h[u]};h[u]=cnt;}
unordered_map<int,int>mp[N]; 
void swap(int &x,int &y){int t=x;x=y;y=t;}
int max(int x,int y){return x>y?x:y;}
int min(int x,int y){return x<y?x:y;}
void dfs(int u,int fa)
{
	f[u]=fa;
	for(int i=h[u];i;i=e[i].n)
	{
		int v=e[i].v;
		if(v!=fa)dfs(v,u);
	}
}
int read(){
	int sum=0;bool f=0;char c=getchar();
	for(;c<48||c>57;c=getchar())if(c==45)f=1;
	for(;c>=48&&c<=57;c=getchar())sum=sum*10+(c&15);
	return f?-sum:sum;
}
signed main(){
	freopen("tioj_outplay.in","r",stdin);freopen("tioj_outplay.out","w",stdout);
	n=read();k=read();m=read();
	fo(i,1,n)a[i]=read();
	fo(i,1,n-1)x=read(),y=read(),ad(x,y),ad(y,x);
	dfs(1,0);
	ans+=a[1]==0;
	fo(i,2,n)
	{
		ans+=a[i]==a[f[i]]; 
		mp[f[i]][a[i]]++;
	}
	while(m--)
	{
		x=read();y=read();
		ans+=mp[x][y]-mp[x][a[x]];
		if(x==1)
			ans+=(y==0)-(a[x]==0);
		else
		{
			ans+=(y==a[f[x]])-(a[x]==a[f[x]]);
			mp[f[x]][a[x]]--;mp[f[x]][y]++;
		}
		a[x]=y;
		printf("%lld\n",n-ans);
	}
	return 0;
}