#include <iostream>
#include <cstdio>
#include <vector>
#include <bitset>
#include <cstring>
using namespace std;
int read(){
	int x=0;
	char ch=getchar();
	while(ch<'0'||ch>'9')ch=getchar();
	while(ch>='0'&&ch<='9')x=x*10+ch-'0',ch=getchar();
	return x;
}
int n1,n2,m;
int o[1000005],a[1000005],b[1000005],c[1000005],d[1000005];
int qwq_col[25];
vector<int> qid[1000005];
int qwq[1000005][25],D[1000005][25];
struct Tree{
	int n,m,u[400005],v[400005],first[200005],nxt[400005];
	int col[200005];
	vector<int> e[200005];
	void add(int a,int b){
		int i=++m;
		u[i]=a,v[i]=b;
		nxt[i]=first[u[i]],first[u[i]]=i;
		return;
	}
	void get_e(int now,int fa){
		for (int i=first[now];i;i=nxt[i])
			if (v[i]!=fa){
				e[now].push_back(v[i]);
				get_e(v[i],now);
			}
		return;
	}
	void init(){
		get_e(1,0);
		return;
	}
	int dis[200005],head,tail,q[200005];
	vector<int> get_id(int x,int d){
		vector<int> qwq;
		for (int i=1;i<=n;i++)dis[i]=-1;
		dis[x]=0;
		head=tail=1;
		q[1]=x;
		while(head<=tail){
			int now=q[head];
			head++;
			qwq.push_back(now);
			if (dis[now]==d)continue;
			for (int i=0;i<(int)e[now].size();i++){
				dis[e[now][i]]=dis[now]+1;
				q[++tail]=e[now][i];
			}
		}
		return qwq;
	}
}T1,T2;
namespace DS_1{
	int book[200005];
	int ask(int x,int d){
		int ans=0;
		vector<int> id=T1.get_id(x,d);
		for (int i=0;i<(int)id.size();i++)
			if (book[T1.col[id[i]]]==0){
				ans++;
				book[T1.col[id[i]]]=1;
			}
		for (int i=0;i<(int)id.size();i++)book[T1.col[id[i]]]=0;
		return ans;
	}
}
namespace DS_2{
	const int maxn=200000;
	int depth[200005];
	struct node{
		int l,r,c;
		node(){
			l=r=c=0;
			return;
		}
	}tree[20000005];
	int cnt;
	int root1[200005],root2[200005];
	void ins1(int &now,int nowl,int nowr,int pos,int val){
		int pre=now;
		now=++cnt;
		tree[now]=tree[pre];
		tree[now].c+=val;
		if (nowl==nowr)return;
		int mid=(nowl+nowr)/2;
		if (pos<=mid)ins1(tree[now].l,nowl,mid,pos,val);
		else ins1(tree[now].r,mid+1,nowr,pos,val);
		return;
	}
	int ask1(int now,int nowl,int nowr,int lt,int rt){
		if (now==0)return 0;
		if (nowl>=lt&&nowr<=rt)return tree[now].c;
		int mid=(nowl+nowr)/2,s=0;
		if (mid>=lt)s+=ask1(tree[now].l,nowl,mid,lt,rt);
		if (mid+1<=rt)s+=ask1(tree[now].r,mid+1,nowr,lt,rt);
		return s;
	}
	void ins2(int &now,int nowl,int nowr,int pos,int val,int &rt){
		int pre=now;
		now=++cnt;
		tree[now]=tree[pre];
		if (nowl==nowr){
			if (tree[now].c==0)tree[now].c=maxn+1;
			if (val<tree[now].c){
				if (tree[now].c<=maxn)ins1(rt,1,maxn,tree[now].c,-1);
				tree[now].c=val;
				if (tree[now].c<=maxn)ins1(rt,1,maxn,tree[now].c,1);
			}
			return;
		}
		int mid=(nowl+nowr)/2;
		if (pos<=mid)ins2(tree[now].l,nowl,mid,pos,val,rt);
		else ins2(tree[now].r,mid+1,nowr,pos,val,rt);
		return;
	}
	int merge1(int x,int y,int nowl,int nowr){
		if (x==0)return y;
		if (y==0)return x;
		if (nowl==nowr){
			int z=++cnt;
			tree[z].c=tree[x].c+tree[y].c;
			return z;
		}
		int mid=(nowl+nowr)/2;
		int z=++cnt;
		tree[z].c=tree[x].c+tree[y].c;
		tree[z].l=merge1(tree[x].l,tree[y].l,nowl,mid);
		tree[z].r=merge1(tree[x].r,tree[y].r,mid+1,nowr);
		return z;
	}
	int merge2(int x,int y,int nowl,int nowr,int &rt){
		if (x==0)return y;
		if (y==0)return x;
		if (nowl==nowr){
			int z=++cnt;
			tree[z].c=min(tree[x].c,tree[y].c);
			if (max(tree[x].c,tree[y].c)<=maxn)ins1(rt,1,maxn,max(tree[x].c,tree[y].c),-1);
			return z;
		}
		int mid=(nowl+nowr)/2;
		int z=++cnt;
		tree[z].l=merge2(tree[x].l,tree[y].l,nowl,mid,rt);
		tree[z].r=merge2(tree[x].r,tree[y].r,mid+1,nowr,rt);
		return z;
	}
	void dfs(int now,int d){
		depth[now]=d;
		ins2(root2[now],1,maxn,T2.col[now],d,root1[now]);
		for (int i=0;i<(int)T2.e[now].size();i++){
			int v=T2.e[now][i];
			dfs(v,d+1);
			root1[now]=merge1(root1[now],root1[v],1,maxn);
			root2[now]=merge2(root2[now],root2[v],1,maxn,root1[now]);
		}
		return;
	}
	int ask(int x,int d){
		return ask1(root1[x],1,maxn,depth[x],min(maxn,depth[x]+d));
	}
	void init(){
		dfs(1,1);
		return;
	}
}
namespace DS_12{
	int depth[200005],sz[200005],son[200005];
	void dfs1(int now,int d){
		depth[now]=d,sz[now]=1,son[now]=0;
		for (int i=0;i<(int)T2.e[now].size();i++){
			int v=T2.e[now][i];
			dfs1(v,d+1);
			sz[now]+=sz[v];
			if (son[now]==0||sz[v]>sz[son[now]])son[now]=v;
		}
		return;
	}
	int mn[200005];
	int tot,sta[200005][2];
	void upd(int x,int y){
		++tot;
		sta[tot][0]=x,sta[tot][1]=mn[x];
		mn[x]=min(mn[x],y);
		return;
	}
	void dfs3(int now){
		upd(T2.col[now],depth[now]);
		for (int i=0;i<(int)T2.e[now].size();i++){
			int v=T2.e[now][i];
			dfs3(v);
		}
		return;
	}
	void dfs2(int now,int ish){
		int _tot=tot;
		for (int i=0;i<(int)T2.e[now].size();i++){
			int v=T2.e[now][i];
			if (v!=son[now])dfs2(v,0);
		}
		if (son[now]!=0)dfs2(son[now],1);
		upd(T2.col[now],depth[now]);		
		for (int i=0;i<(int)T2.e[now].size();i++){
			int v=T2.e[now][i];
			if (v!=son[now])dfs3(v);
		}
		for (int i=0;i<(int)qid[now].size();i++){
			int id=qid[now][i];
			for (int j=1;j<=T1.n;j++)D[id][j]=mn[qwq[id][j]]-depth[now];
		}
		if (ish==0){
			while(tot>_tot){
				mn[sta[tot][0]]=sta[tot][1];
				tot--;
			}
		}
		return;
	}
	void init(){
		dfs1(1,1);
		memset(mn,0x3f,sizeof(mn));
		dfs2(1,0);
		return;
	}
}
int book[200005];
int main(){
	n1=read(),n2=read(),m=read();
	T1.n=n1;
	for (int i=1;i<n1;i++){
		int u=read(),v=read();
		T1.add(u,v),T1.add(v,u);
	}
	T2.n=n2;
	for (int i=1;i<n2;i++){
		int u=read(),v=read();
		T2.add(u,v),T2.add(v,u);
	}
	for (int i=1;i<=n1;i++)T1.col[i]=read();
	for (int i=1;i<=n2;i++)T2.col[i]=read();
	T1.init(),T2.init();
	for (int i=1;i<=m;i++){
		o[i]=read();
		if (o[i]==1)a[i]=read(),b[i]=read(),c[i]=read(),d[i]=read();
		if (o[i]==2)a[i]=read(),b[i]=read();
	}
	for (int i=1;i<=T1.n;i++)qwq_col[i]=T1.col[i];
	for (int i=1;i<=m;i++){
		if (o[i]==1){
			qid[b[i]].push_back(i);
			for (int j=1;j<=T1.n;j++)qwq[i][j]=qwq_col[j];
		}
		else qwq_col[a[i]]=b[i];
	}
	DS_2::init();
	DS_12::init();
	int lt=0;
	for (int i=1;i<=m;i++){
		if (o[i]==1){
			c[i]^=lt,d[i]^=lt;
			lt=DS_1::ask(a[i],c[i])+DS_2::ask(b[i],d[i]);
			vector<int> id=T1.get_id(a[i],c[i]);
			for (int j=0;j<(int)id.size();j++){
				if (book[T1.col[id[j]]]==1)continue;
				book[T1.col[id[j]]]=1;
				if (D[i][id[j]]<=d[i])lt--;
			}
			for (int j=0;j<(int)id.size();j++)book[T1.col[id[j]]]=0;
			printf("%d\n",lt);
		}
		else T1.col[a[i]]=b[i];
	}
	return 0;
}