#include<bits/stdc++.h>
using namespace std;
const int N=400005,Q=1000005;
int n,m,q,mx;
struct SGT{
	int rt[N],tr[N<<5],ls[N<<5],rs[N<<5],tot;
}T1,T2;
int st[N],top,tmp[N];
void upd1(int &x,int l,int r,int C,int D){
	x=++T1.tot;
	if (l==r){
		T1.tr[x]=D;
		return;
	}
	int mid=(l+r)>>1;
	if (C<=mid)upd1(T1.ls[x],l,mid,C,D);
	else upd1(T1.rs[x],mid+1,r,C,D);
}
void upd2(int &x,int l,int r,int D){
	x=++T2.tot;
	T2.tr[x]=1;
	if (l==r)return;
	int mid=(l+r)>>1;
	if (D<=mid)upd2(T2.ls[x],l,mid,D);
	else upd2(T2.rs[x],mid+1,r,D);
}
int merge1(int x,int y,int l,int r){
	if ((!x)||(!y))return x+y;
	int z=++T1.tot;
	if (l==r){
		T1.tr[z]=min(T1.tr[x],T1.tr[y]);
		int o=max(T1.tr[x],T1.tr[y]);
		st[++top]=o;
		++tmp[o];
	}
	else{
		int mid=(l+r)>>1;
		T1.ls[z]=merge1(T1.ls[x],T1.ls[y],l,mid);
		T1.rs[z]=merge1(T1.rs[x],T1.rs[y],mid+1,r);
	}
	return z;
}
int merge2(int x,int y,int l,int r){
	if ((!x)||(!y))return x+y;
	int z=++T2.tot;
	if (l==r){
		T2.tr[z]=T2.tr[x]+T2.tr[y];
		return z;
	}
	int mid=(l+r)>>1;
	T2.ls[z]=merge2(T2.ls[x],T2.ls[y],l,mid);
	T2.rs[z]=merge2(T2.rs[x],T2.rs[y],mid+1,r);
	T2.tr[z]=T2.tr[T2.ls[z]]+T2.tr[T2.rs[z]];
	return z;
}
int qry2(int x,int l,int r,int D){
	if (!x)return 0;
	if (l>D)return 0;
	if (r<=D)return T2.tr[x];
	int mid=(l+r)>>1;
	return qry2(T2.ls[x],l,mid,D)+qry2(T2.rs[x],mid+1,r,D);
}
int qry1(int x,int l,int r,int C){
	if (!x)return 0;
	if (l==r)return T1.tr[x];
	int mid=(l+r)>>1;
	if (C<=mid)return qry1(T1.ls[x],l,mid,C);
	return qry1(T1.rs[x],mid+1,r,C);
}
void print2(int x,int l,int r){
	if (!x)return;
	if (l==r)return cout<<l<<" ",void();
	int mid=(l+r)>>1;
	print2(T2.ls[x],l,mid);
	print2(T2.rs[x],mid+1,r);
}
void print(int x,int l,int r){
	if (!x)return;
	if (l==r)return cout<<l<<" ",void();
	int mid=(l+r)>>1;
	print(T1.ls[x],l,mid);
	print(T1.rs[x],mid+1,r);
}
int chk(int x,int C,int lim){
	int o=qry1(T1.rt[x],1,m,C);
	if (o==0||o>lim)return 1;
	return 0;
}
int wk(int x,int l,int r,int D){
	if (!x)return 0;
	int y=++T2.tot;
	T2.tr[y]=T2.tr[x]-1;
	int mid=(l+r)>>1;
	if (D<=mid){
		T2.rs[y]=T2.rs[x];
		T2.ls[y]=wk(T2.ls[x],l,mid,D);
	}
	else{
		T2.ls[y]=T2.ls[x];
		T2.rs[y]=wk(T2.rs[x],mid+1,r,D);
	}
	return y;
}
const int inf=1e9;
int bz[N],ti,tem[N],cnt;
int buc[N];
vector<pair<int,int>>anss[N],ask[N];
struct Graph{
	vector<int>E[N];
	void add(int x,int y){E[x].emplace_back(y),E[y].emplace_back(x);}
	int col[N],dep[N],fa[N],sz[N],rnk[N],son[N],dfn[N],L[N],R[N],tottt;
	void dfs(int x,int fat){
		dep[x]=dep[fat]+1;
		fa[x]=fat;sz[x]=1;
		for (int y:E[x])if (y!=fat)dfs(y,x),sz[x]+=sz[y],son[x]=(sz[y]>sz[son[x]]?y:son[x]);
	}
	void dfs1(int x){
		dfn[x]=++tottt;rnk[tottt]=x;
		L[x]=R[x]=dfn[x];
		if (son[x])dfs1(son[x]);
		for (int y:E[x])if (y!=son[x]&&y!=fa[x])dfs1(y);
		for (int y:E[x])if (y!=fa[x])R[x]=max(R[x],R[y]);
	}
	void dfs2(int x,int fat){
		upd1(T1.rt[x],1,m,col[x],dep[x]);
		upd2(T2.rt[x],1,mx,dep[x]);
		for (int y:E[x])if (y!=fat){
			dfs2(y,x);
			T1.rt[x]=merge1(T1.rt[x],T1.rt[y],1,mx);
			T2.rt[x]=merge2(T2.rt[x],T2.rt[y],1,mx);
			while (top){
				T2.rt[x]=wk(T2.rt[x],1,mx,st[top]);
				--tmp[st[top]],--top;
			}
		}
	}
	void dfs3(int x,int D){
		if (dep[x]>D)return;
		if (bz[col[x]]!=ti)tem[++cnt]=col[x];
		bz[col[x]]=ti;
		for (int y:E[x])if (y!=fa[x])dfs3(y,D);
	}
	void dfs5(int x){
		if (bz[col[x]]!=ti)tem[++cnt]=col[x];
		bz[col[x]]=ti;
		for (int y:E[x])if (y!=fa[x])dfs5(y);
	}
	void dfs4(int x,int tp){
		for (int y:E[x])if (y!=fa[x]&&y!=son[x]){
			dfs4(y,0);
		}
		if (son[x])dfs4(son[x],1);
		for (int y:E[x])if (y!=fa[x]&&y!=son[x]){
			for (int i=L[y];i<=R[y];++i){
				buc[col[i]]=min(buc[col[i]],dep[rnk[i]]);
			}
		}
		buc[col[x]]=min(buc[col[x]],dep[x]);
		for (auto o:ask[x]){
			anss[o.first].emplace_back(make_pair(o.second,buc[o.second]));
		}
		if (!tp){
			for (int i=L[x];i<=R[x];++i){
				buc[col[i]]=inf;
			}
		}
	}
}G1,G2;
struct Query{
	int tp,x,y,u,v;
}que[Q];
int coll[N];

int main(){
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	cin>>n>>m>>q;
	for (int i=1;i<n;++i){
		int x,y;
		cin>>x>>y;
		G1.add(x,y);
	}
	for (int i=1;i<m;++i){
		int x,y;
		cin>>x>>y;
		G2.add(x,y);
	}
	for (int i=1;i<=n;++i)cin>>G1.col[i];
	for (int i=1;i<=m;++i)cin>>G2.col[i];
	for (int i=1;i<=q;++i){
		cin>>que[i].tp;
		if (que[i].tp==1)cin>>que[i].x>>que[i].y>>que[i].u>>que[i].v;
		else cin>>que[i].x>>que[i].y;
	}
	mx=max(n,m);
	G1.dfs(1,0);
	G2.dfs(1,0);
	G2.dfs2(1,0);
	for (int i=1;i<=n;++i)coll[i]=G1.col[i];
	for (int i=1;i<=q;++i){
		++ti,cnt=0;
		if (que[i].tp==1){
			G1.dfs5(que[i].x);
			for (int j=1;j<=cnt;++j)ask[que[i].y].emplace_back(make_pair(i,tem[j]));
		}
		else{
			G1.col[que[i].x]=que[i].y;
		}
	}
	for (int i=1;i<=m;++i)buc[i]=inf;
	G2.dfs4(1,0);
	for (int i=1;i<=n;++i)G1.col[i]=coll[i];
	int lst=0;
	for (int i=1;i<=q;++i){
		++ti,cnt=0;
		if (que[i].tp==1){
			que[i].u^=lst;que[i].v^=lst;
			G1.dfs3(que[i].x,G1.dep[que[i].x]+que[i].u);
			int now=qry2(T2.rt[que[i].y],1,mx,G2.dep[que[i].y]+que[i].v);
			for (auto o:anss[i]){
				if (bz[o.first]==ti){
					now+=(o.second>G2.dep[que[i].y]+que[i].v);
				}
			}
			
//			for (int j=1;j<=cnt;++j)now+=chk(que[i].y,tem[j],G2.dep[que[i].y]+que[i].v);
			cout<<now<<"\n";
			lst=now;
		}
		else{
			G1.col[que[i].x]=que[i].y;
		}
	}
}