#include<bits/stdc++.h>
using namespace std;const int N=5e5+50,Q=2e6,M=21,inf=1e9+7,T=1e7;int n,m,q,c[M],V[N],rc[M];vector<int>s[M],g[N];struct edge{int u,v,nxt;}e[N];int H[N],cnt,dp[M];void O(){int u,v;cin>>u>>v;e[++cnt]=(edge){u,v,H[u]};H[u]=cnt;e[++cnt]=(edge){v,u,H[v]};H[v]=cnt;}void A(){int u,v;cin>>u>>v;g[u].push_back(v);g[v].push_back(u);}void init(int x,int fa){s[x].push_back(x);dp[x]=dp[fa]+1;for(auto v:g[x])if(v!=fa){init(v,x);for(auto t:s[v])s[x].push_back(t);}}vector<int>L[N];int cc[N],ty[Q],Y[Q],U[Q],W[Q],R[Q],siz[N],son[N],d[N],rv[N];void dfs(int x,int f){siz[x]=1;d[x]=d[f]+1;for(int i=H[x];i;i=e[i].nxt)if(e[i].v!=f){int v=e[i].v;dfs(v,x);siz[x]+=siz[v];if(siz[v]>siz[son[x]])son[x]=v;}}vector<int>p[M];int D[M][N],B[M][N];int sum[T],tot,tl[T],tr[T],ro[N];
#define mid ((l+r)>>1)
void I(int&x,int l,int r,int d,int w){++tot;sum[tot]=sum[x]+w;tl[tot]=tl[x];tr[tot]=tr[x];x=tot;if(l==r)return;if(d<=mid)I(tl[x],l,mid,d,w);else I(tr[x],mid+1,r,d,w);}int F(int x,int l,int r,int L,int R){if(L<=l&&R>=r)return sum[x];if(!x)return 0;int ans=0;if(L<=mid)ans+=F(tl[x],l,mid,L,R);if(R>mid)ans+=F(tr[x],mid+1,r,L,R);return ans;}void up(int E,int w,int d,int x){if(!B[E][w]){B[E][w]=1,D[E][w]=d,I(ro[x],1,m,d,1),p[E].push_back(w);}else if(D[E][w]>d)I(ro[x],1,m,D[E][w],-1),I(ro[x],1,m,d,1),D[E][w]=d;}void G(int u,int v,int x){for(auto w:p[v])up(u,w,D[v][w],x),B[v][w]=0;}void S(int x,int fa,int E){if(son[x])S(son[x],x,E),ro[x]=ro[son[x]];up(E,V[x],d[x],x);for(int i=H[x];i;i=e[i].nxt)if(e[i].v!=fa&&e[i].v!=son[x]){int v=e[i].v;p[E+1].clear();S(v,x,E+1);G(E,E+1,x);}for(auto&t:L[x])t=(B[E][t]?D[E][t]:inf);}main(){cin>>n>>m>>q;for(int i=1;i<n;i++)A();for(int i=1;i<m;i++)O();for(int i=1;i<=n;i++)cin>>c[i],rc[i]=c[i];for(int i=1;i<=m;i++)cin>>V[i];init(1,0);for(int i=1;i<=q;i++){cin>>ty[i];if(ty[i]==1){cin>>W[i]>>R[i]>>Y[i]>>U[i];for(auto x:s[W[i]])L[R[i]].push_back(c[x]);}else cin>>W[i]>>R[i],c[W[i]]=R[i];}dfs(1,1);S(1,1,1);for(int i=1;i<=n;i++)c[i]=rc[i];for(int i=1,las=0,u,v;i<=q;i++){if(ty[i]==1){Y[i]^=las;U[i]^=las;u=R[i],v=W[i];las=F(ro[u],1,m,d[u],min(m,d[u]+U[i]));for(auto x:s[v]){if(dp[x]-dp[v]<=Y[i]&&rv[c[x]]!=i)rv[c[x]]=i,las+=(L[u][cc[u]]>d[u]+U[i]);++cc[u];}cout<<las<<'\n';}else c[W[i]]=R[i];}}