#include <bits/stdc++.h>
using namespace std;
const int N=2.1e5+5,M=1e6+5;
namespace tr{
    struct node{
    	int lson,rson,sm;
    }p[N*400];
    int idx;
    void upset(int x){
    	p[x].sm=p[p[x].lson].sm+p[p[x].rson].sm;
    }
    void add(int x,int y,int d,int sm,int nl,int nr){
    	if(nl==nr){
    		p[y].sm=p[x].sm+sm;
    		return;
    	}
    	int mid=nl+nr>>1;
    	if(d<=mid){
    		p[y].rson=p[x].rson;
    		p[y].lson=++idx;
    		add(p[x].lson,idx,d,sm,nl,mid);
    	}else{
    		p[y].lson=p[x].lson;
    		p[y].rson=++idx;
    		add(p[x].rson,idx,d,sm,mid+1,nr);
    	}
    	upset(y);
    }
    int gets(int x,int l,int r,int nl,int nr){
    	if(!x)return 0;
    	if(l<=nl&&r>=nr)return p[x].sm;
    	int mid=nl+nr>>1;
    	if(r<=mid)return gets(p[x].lson,l,r,nl,mid);
    	if(l>mid)return gets(p[x].rson,l,r,mid+1,nr);
    	return gets(p[x].lson,l,r,nl,mid)+gets(p[x].rson,l,r,mid+1,nr);
    }
}
int n,m,qs,ans,hd[N],mk[N],w[N],zx[N],bk[N],rt[N],lg2[N],siz[N],w1[N],w2[N],mx,dfn1[N],dfn2[N],eds1[N],eds2[N],dy1[N],dy2[N],dep1[N],dep2[N],idx1,idx2;
vector<int>e[N],p[N],jls,jl,jj,ask[N],rs[N];
map<int,int>qss;
void dfs1(int x){
	mk[x]=1;dfn1[x]=++idx1;
	dy1[idx1]=x;
	for(auto c:e[x]){
		if(mk[c])continue;
		dep1[c]=dep1[x]+1;
		dfs1(c);
	}
	eds1[x]=idx1;
	mk[x]=0;
}
void dfs2(int x){
	mk[x]=1;dfn2[x]=++idx2;
	dy2[idx2]=x;
	for(auto c:p[x]){
		if(mk[c])continue;
		dep2[c]=dep2[x]+1;
		dfs2(c);
	}
	eds2[x]=idx2;
	mk[x]=0;
}
bool cmp(int a,int b){
	if(mk[a]!=mk[b])return mk[a]>mk[b];
	return siz[a]<siz[b];
}
void dfs(int x){
	mk[x]=1;
	siz[x]=1;
	for(auto c:p[x]){
		if(mk[c])continue;
		dfs(c);
		siz[x]+=siz[c];
	}
	sort(p[x].begin(),p[x].end(),cmp);
	mk[x]=0;
}
void clr(){
	while(jls.size())zx[jls.back()]=m,jls.pop_back();
}
void add(int &x,int l,int r,int sm){
//	cout<<l<<" "<<r<<" "<<sm<<endl;
	int tmp=++tr::idx;
	tr::add(x,tmp,l,sm,0,m);
	x=tmp;
	tmp=++tr::idx;
	tr::add(x,tmp,r+1,-sm,0,m);
	x=tmp;
}
void add(int x,int&y){
//	cout<<"add"<<x<<endl;
	jls.push_back(w2[x]);
	if(dep2[x]<zx[w2[x]])add(y,dep2[x],zx[w2[x]]-1,1),zx[w2[x]]=dep2[x];
}
void dfs3(int x){
	bk[x]=1;jj.push_back(x);
	for(auto c:p[x]){
		if(bk[c]||mk[c])continue;
		dfs3(c);
	}
	bk[x]=0;
}
bool cmp2(int a,int b){
	return dep2[a]<dep2[b];
}
void solve(int x){
	mk[x]=1;
	for(auto c:p[x]){
		if(mk[c])continue;
		clr();
		solve(c);
	}
	if(!mk[p[x].back()])rt[x]=rt[p[x].back()];
	else rt[x]=++tr::idx;
//	cout<<x<<" "<<p[x].back()<<endl;
    jj.clear();
    jj.push_back(x);
	for(int i=0;i<p[x].size()-1;i++){
		int c=p[x][i];
		if(mk[c])continue;
		dfs3(c);
	}
	sort(jj.begin(),jj.end(),cmp2);
	for(auto c:jj)add(c,rt[x]);
	for(auto c:ask[x]){
		//cout<<x<<"-"<<c<<" "<<zx[c]<<endl;
		if(zx[c]!=m)rs[x].push_back(zx[c]);
		else rs[x].push_back(1e9);
	}
	mk[x]=0;
}
struct nodes{
	int op,x,y,a,b;
}gs[M];
signed main(){
//	freopen("in.txt","r",stdin);
	ios::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	cin>>n>>m>>qs;
	for(int i=1;i<=m;i++)lg2[i]=__lg(i);
	for(int i=1;i<n;i++){
		int x,y;
		cin>>x>>y;
		e[x].push_back(y);
		e[y].push_back(x);
	}
	for(int i=1;i<m;i++){
		int x,y;
		cin>>x>>y;
		p[x].push_back(y);
		p[y].push_back(x);
	}
	for(int i=1;i<=n;i++)cin>>w1[i],jl.push_back(w1[i]);
	for(int i=1;i<=m;i++)cin>>w2[i],jl.push_back(w2[i]);
	sort(jl.begin(),jl.end());
	jl.resize(unique(jl.begin(),jl.end())-jl.begin());
	for(int i=1;i<=jl.size();i++)qss[jl[i-1]]=i;
	mx=jl.size();
	for(int i=1;i<=n;i++)w1[i]=lower_bound(jl.begin(),jl.end(),w1[i])-jl.begin()+1;
	for(int i=1;i<=m;i++)w2[i]=lower_bound(jl.begin(),jl.end(),w2[i])-jl.begin()+1;
	for(int i=1;i<N;i++)zx[i]=m;
	dfs1(1);
	dfs2(1);
	dfs(1);
	memcpy(w,w1,sizeof(w));
	for(int t=1;t<=qs;t++){
		int op,x,y,a,b;
		cin>>op>>x>>y;
		if(op==1){
			cin>>a>>b;
			for(int i=dfn1[x];i<=eds1[x];i++){
				int c=w1[dy1[i]];
				ask[y].push_back(c);
			//	cout<<y<<" "<<c<<endl;
			}
		}else{
			if(!qss[y])qss[y]=++mx;
			w1[x]=qss[y];
		}
		gs[t]={op,x,y,a,b};
	}
	solve(1);
	memcpy(w1,w,sizeof(w));
	for(int t=1;t<=qs;t++){
		int op=gs[t].op,x=gs[t].x,y=gs[t].y,a=gs[t].a,b=gs[t].b;
		if(op==1){
			a^=ans;b^=ans;
			int res=tr::gets(rt[y],0,min(dep2[y]+b,m-1),0,m);
			set<int>q;
			for(int i=dfn1[x];i<=eds1[x];i++){
				int c=w1[dy1[i]];
				int ans=rs[y][hd[y]++];
				if(dep1[dy1[i]]-dep1[x]>a)continue;
				if(q.count(c))continue;
				q.insert(c);
				if(ans-dep2[y]>b)res++;
			}
			cout<<(ans=res)<<"\n";
		}else{
			w1[x]=qss[y];
		}
	}
}