#include<bits/stdc++.h>
#define ll long long
#define rg int
#define ci const int
#define ls x<<1
#define rs x<<1|1
#define mid ((l+r)>>1)
#define ld long double
#define fo(i,l,r) for(int i=(l);i<=(r);++i)
#define fd(i,l,r) for(int i=(l);i>=(r);--i)
#define fu(i,l,r) for(int i=(l);i<(r);++i)
#define gcd __gcd
#define P(x) __builtin_popcountll(x)
using namespace std;
ci N=2e6+5,M=5e3+5,mod=998244353,_g=3,_ig=(mod+1)/3;
ll ksm(ll a,ll b=mod-2)
{
	ll ans=1;
	while(b)
	{
		if(b&1)ans=(ll)ans*a%mod;
		a=(ll)a*a%mod,b>>=1;
	}
	return ans;
}
const ld eps=1e-10;
inline ll read(){ll u,f=1;char o;while((o=getchar())<48||o>57)if(o==45)f=-1;u=(o^48);while((o=getchar())>=48&&o<=57)u=(u<<1)+(u<<3)+(o^48);return u*f;}
void write(ll x){if(x<0)putchar(45),x=-x;if(x>9)write(x/10);putchar(x%10+48);}
mt19937 rad(chrono::steady_clock::now().time_since_epoch().count());
ll n,m,q,v[N],v1[N],p1,p2,d1,d2,ans;
vector<ll>w[N],w1[N];
bool f[N];
ll ceng[N];
void tree(int x,int c)
{
	f[x]=1;
	ceng[x]=c;
	for(auto d:w[x])if(!f[d])
	{
		tree(d,c+1); 
	}
}
bool t[N];
void tr(int x,int c)
{
	if(c>d1)return;
	if(!t[v[x]])++ans;
	t[v[x]]=1;
	for(auto d:w[x])if(ceng[d]>ceng[x])
	{
		tr(d,c+1);
	}
}
void tre(int x,int c)
{
	if(c>d2)return;
	if(!t[v1[x]])++ans;
	t[v1[x]]=1;
	for(auto d:w1[x])if(ceng[d]>ceng[x])
	{
		tre(d,c+1);
	}
}
int main()
{//freopen("1.in","r",stdin);
//	freopen("c.in","r",stdin);
//	freopen("c.out","w",stdout);
	int T=1;
	while(T--)
	{
		n=read();m=read();q=read();
		fu(i,1,n)
		{
			ll x=read(),y=read();
			w[x].push_back(y);
			w[y].push_back(x);
		}
		fu(i,1,m)
		{
			ll x=read(),y=read();
			w1[x].push_back(y);
			w1[y].push_back(x);
		}
		fo(i,1,n)v[i]=read();
		fo(i,1,m)v1[i]=read();
		tree(1,1);
		ll last=0;
		while(q--)
		{
			int op=read();
			if(op==1)
			{
				ans=0;
				fo(i,1,m)t[i]=0;
				p1=read(),p2=read(),d1=(read()^last),d2=(read()^last);
				tr(p1,0);
				tre(p2,0);
				write(last=ans),putchar('\n');
			}
			else
			{
				int x=read(),y=read();
				v[x]=y;
			}
		}
	}
	return 0;
}