#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],val[N];
vector<int>s[M],g[N];

struct edge
{
    int u,v,nxt;
}e[N];

int head[N],cnt,dp[M];

void add()
{
    int u,v;cin>>u>>v;
    e[++cnt]=(edge){u,v,head[u]};head[u]=cnt;
    e[++cnt]=(edge){v,u,head[v]};head[v]=cnt;
}

void Aadd()
{
    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>ask[N];
int cc[N],ty[Q],d1[Q],d2[Q],p1[Q],p2[Q],siz[N],son[N],d[N];

void dfs(int x,int f)
{
    siz[x]=1;d[x]=d[f]+1;
    for(int i=head[x];i;i=e[i].nxt)
    {
        int v=e[i].v;
        if(v==f)continue;
        dfs(v,x);siz[x]+=siz[v];
        if(siz[v]>siz[son[x]])son[x]=v;
    }
}

vector<int>p[M];
int mindep[M][N],vis[M][N];

int sum[T],tot,tl[T],tr[T],ro[N];

#define mid ((l+r)>>1)

void insert(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)insert(tl[x],l,mid,d,w);else insert(tr[x],mid+1,r,d,w);
}

int find(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+=find(tl[x],l,mid,L,R);
    if(R>mid)ans+=find(tr[x],mid+1,r,L,R);
    return ans;
}

void up(int dep,int w,int d,int x)
{
    if(!vis[dep][w])
    {
        vis[dep][w]=1;
        mindep[dep][w]=d;
        insert(ro[x],1,m,d,1);
        p[dep].push_back(w);
    }
    else if(mindep[dep][w]>d)
    {
        insert(ro[x],1,m,mindep[dep][w],-1);
        insert(ro[x],1,m,d,1);
        mindep[dep][w]=d;
    }
}

void merge(int u,int v,int x)
{
    for(auto w:p[v])up(u,w,mindep[v][w],x),vis[v][w]=0;
}

void solve(int x,int fa,int dep)
{
    if(son[x])solve(son[x],x,dep),ro[x]=ro[son[x]];
    up(dep,val[x],d[x],x);
    for(int i=head[x];i;i=e[i].nxt)
    {
        int v=e[i].v;if(v==fa||v==son[x])continue;
        p[dep+1].clear();
        solve(v,x,dep+1);merge(dep,dep+1,x);
    }
    for(auto&t:ask[x])t=(vis[dep][t]?mindep[dep][t]:inf);
}

int mx=0;

main()
{
    // freopen("in.txt","r",stdin);
    // freopen("out.txt","w",stdout);
    cin>>n>>m>>q;
    for(int i=1;i<n;i++)Aadd();
    for(int i=1;i<m;i++)add();
    for(int i=1;i<=n;i++)
    {
        cin>>c[i];mx=max(mx,c[i]);
    }
    for(int i=1;i<=m;i++)
    {
        cin>>val[i];mx=max(mx,val[i]);
    }
    init(1,0);
    for(int i=1,u,v;i<=q;i++)
    {
        cin>>ty[i];
        if(ty[i]==1)
        {
            cin>>p1[i]>>p2[i]>>d1[i]>>d2[i];
            for(auto x:s[p1[i]])ask[p2[i]].push_back(c[x]);
        }
        else cin>>u>>v,c[u]=v,mx=max(mx,v);
    }
    dfs(1,1);solve(1,1,1);
    for(int i=1,las=0;i<=q;i++)if(ty[i]==1)
    {
        d1[i]^=las;d2[i]^=las;
        las=find(ro[p2[i]],1,m,d[p2[i]],min(m,d[p2[i]]+d2[i]));
        for(auto x:s[p1[i]])
        {
            if(dp[x]-dp[p1[i]]<=d1[i])las+=(ask[p2[i]][cc[p2[i]]]>d[p2[i]]+d2[i]);
            ++cc[p2[i]];
        }
        cout<<las<<'\n';
    }
}