#include<bits/stdc++.h>
#define ll long long
#define pir pair<int,int>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
using namespace std;
inline int re()
{
    int f=1,num=0;
    char c=getchar();
    while(c<'0'||c>'9'){if(c=='-') f=-1;c=getchar();}
    while(c>='0'&&c<='9') num=num*10+c-'0',c=getchar();
    return num*f;
}
int T;
void clear();
const int N=200010;
int n,k,q;
vector<int> g[N];
map<int,int> mapp[N];
int d[N],fa[N];
int ans;
void dfs(int x,int f)
{
    fa[x]=f;
    if(fa[x]) mapp[fa[x]][d[x]]++;
    if(d[x]==d[fa[x]]) ans++;
    for(int y:g[x])
    {
        if(y==fa[x]) continue;
        dfs(y,x);
    }
    return;
}
void work()
{
    freopen("tioj_outplay.in","r",stdin);
    freopen("tioj_outplay.out","w",stdout);
    clear();
    n=re();k=re();q=re();
    for(int i=1;i<=n;i++) d[i]=re();
    for(int i=1,x,y;i<n;i++)
    {
        x=re();y=re();
        g[x].pb(y);
        g[y].pb(x);
    }
    dfs(1,0);
    for(int i=1,x,z;i<=q;i++)
    {
        x=re();z=re();
        if(d[x]==d[fa[x]]) ans--;
        if(mapp[x].count(d[x])) ans-=mapp[x][d[x]];
        if(fa[x]) mapp[fa[x]][d[x]]--;
        d[x]=z;
        if(d[x]==d[fa[x]]) ans++;
        if(mapp[x].count(d[x])) ans+=mapp[x][d[x]];
        if(fa[x]) mapp[fa[x]][d[x]]++;
        printf("%d\n",n-ans);
    }
    return;
}
int main()
{
    T=1;
    while(T--) work();
    return 0;
}
void clear()
{
    return;
}