#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define N 200010
#define Q 1001000
ll n,m,q;
vector<ll>g[N],e[N];
ll d1[N],c1[N],df1[N],s1[N];ll dc1=0;
inline bool pd1(ll x,ll y){return df1[x]<=df1[y]&&df1[y]<=df1[x]+s1[x]-1;}
inline void dfs(ll x,ll fa){
    d1[x]=d1[fa]+1;df1[x]=++dc1;s1[x]=1;
    for(auto o:g[x])if(o!=fa)dfs(o,x),s1[x]+=s1[o];
    return ;
}
ll dep[N],col[N];
ll siz[N],son[N],top[N],fa[N];
ll dfn[N],dfncnt=0;
inline bool pd(ll x,ll y){return dfn[x]<=dfn[y]&dfn[y]<=dfn[x]+siz[x]-1;}
inline void dfs1(ll x,ll faa){
    fa[x]=faa;siz[x]=1;dep[x]=dep[faa]+1;
    for(auto o:e[x]){
        if(o==faa)continue;
        dfs1(o,x);siz[x]+=siz[o];
        if(siz[o]>siz[son[x]])son[x]=o;
    }return ;
}
ll dui[N];
inline void dfs2(ll x,ll tp){
    top[x]=tp;dfn[x]=++dfncnt;dui[dfncnt]=x;
    if(son[x]){
        dfs2(son[x],tp);
    }for(auto o:e[x]){
        if(!dfn[o])dfs2(o,o);
    }return ;
}
inline ll lca(ll x,ll y){
    while(top[x]!=top[y]){
        if(dep[top[x]]<dep[top[y]])swap(x,y);
        x=fa[top[x]];
    }if(dep[x]<dep[y])swap(x,y);
    return y;
}
ll rt[N],lc[N*40],rc[N*40],val[N*40];ll gg=0;
inline void pushup(ll o){val[o]=val[lc[o]]+val[rc[o]];return ;}
inline void update(ll &o,ll l,ll r,ll x,ll y){
    if(!o)o=++gg;if(l==r){val[o]+=y;return ;}
    ll mid=(l+r)>>1;
    if(mid>=x)update(lc[o],l,mid,x,y);
    else update(rc[o],mid+1,r,x,y);
    pushup(o);return ;
}
inline ll merge(ll o,ll p,ll l,ll r){
    if(!o||!p)return o+p;
    if(l==r){val[o]+=val[p];return o;}
    ll mid=(l+r)>>1;
    lc[o]=merge(lc[o],lc[p],l,mid);
    rc[o]=merge(rc[o],rc[p],mid+1,r);
    pushup(o);return o;
}
inline ll ask(ll o,ll l,ll r,ll x,ll y){
    if(!o)return 0;if(x<=l&&r<=y)return val[o];
    ll an=0,mid=(l+r)>>1;
    if(mid>=x)an+=ask(lc[o],l,mid,x,y);
    if(mid<y)an+=ask(rc[o],mid+1,r,x,y);
    return an;
}
ll tem[N];ll cn=0;ll mi[N];
vector<ll>ex[N],wc[N];
inline bool cmp(ll x,ll y){return dfn[x]<dfn[y];}
ll vv[N];
inline void build(){
    sort(tem+1,tem+cn+1,cmp);cn=unique(tem+1,tem+cn+1)-tem-1;for(int i=1;i<=cn;i++)vv[tem[i]]=1;
    ll pre=cn;for(int i=1;i<pre;i++)tem[++cn]=lca(tem[i],tem[i+1]);
    sort(tem+1,tem+cn+1,cmp);cn=unique(tem+1,tem+cn+1)-tem-1;
    for(int i=2;i<=cn;i++)ex[lca(tem[i-1],tem[i])].push_back(tem[i]);
    return ;
}
inline void gt(ll x){
    if(vv[x])mi[x]=dep[x];
    for(auto o:ex[x]){
        gt(o);update(rt[x],1,n,mi[o],-1);
        mi[x]=min(mi[x],mi[o]);
    }update(rt[x],1,n,mi[x],1);
    return ;
}
vector<ll>hs[N],dd[N],ji[N],xw[N];
inline void clear(ll tp){
    // if(tp==3)cout<<tem[1]<<' '<<mi[tem[1]]<<' '<<dd[tem[1]].size()<<'\n';
    for(int i=1;i<=cn;i++)hs[tem[i]].push_back(tp),dd[tem[i]].push_back(mi[tem[i]]),ex[tem[i]].clear(),mi[tem[i]]=n+1;cn=0;
    return ;
}
inline void idfs(ll x,ll fa){
    for(auto o:e[x]){
        if(o==fa)continue;
        idfs(o,x);rt[x]=merge(rt[x],rt[o],1,n);
    }return ;
}
#define V 20001000
ll x[V],y[V],ans[V];ll cnt=0;
ll fir[Q],p1[Q],p2[Q],p3[Q],p4[Q];ll gs=0;
ll vis[N];
int main(){
    //freopen("test1.in","r",stdin);
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    cin>>m>>n>>q;for(int i=1,u,v;i<m;i++)cin>>u>>v,g[u].push_back(v),g[v].push_back(u);for(int i=1,u,v;i<n;i++)cin>>u>>v,e[u].push_back(v),e[v].push_back(u);
    for(int i=1;i<=m;i++)cin>>c1[i];for(int i=1;i<=n;i++)cin>>col[i],wc[col[i]].push_back(i);
    dfs(1,0);dfs1(1,0);dfs2(1,1);
    for(int i=1;i<=n;i++)mi[i]=n+1;
    for(int i=1;i<=n;i++){
        for(auto o:wc[i])tem[++cn]=o;if(!cn)continue;
        build();gt(tem[1]);
        clear(i);
    }idfs(1,0);
    for(int i=1;i<=q;i++){
        ll op;cin>>op;if(op==1){
            ++gs;cin>>p1[gs]>>p2[gs]>>p3[gs]>>p4[gs];
            fir[gs]=cnt;for(int i=1;i<=m;i++){
                x[++cnt]=p2[gs];y[cnt]=c1[i];xw[p2[gs]].push_back(cnt);
            }
        }else{
            ll x,y;cin>>x>>y;c1[x]=y;
        }
    }for(int t=1;t<=n;t++){
        ll i=dui[t];for(auto o:xw[i])ji[y[o]].push_back(o);
        ll nw=0;for(auto o:hs[i]){
            ll val=dd[i][nw++];
            for(auto p:ji[o]){
                if(pd(x[p],i))ans[p]=val;
                else ans[p]=n+1;
            }ji[o].clear();
        }
    }for(int i=1;i<=n;i++)for(auto o:ji[i])ans[o]=n+1;
    // cout<<val[rt[1]]<<'\n';
    // cout<<ask(rt[1],1,n,1,3)<<'\n';return 0;
    // cout<<cnt<<'\n';for(int i=1;i<=cnt;i++)cout<<ans[i]<<'\n';
    ll las=0;for(int i=1;i<=gs;i++){
        p3[i]^=las;p4[i]^=las;ll lim=min(dep[p2[i]]+p4[i],n);
        las=ask(rt[p2[i]],1,n,1,lim);
        for(int j=1;j<=m;j++){
            if(!pd1(p1[i],j)||d1[j]>d1[p1[i]]+p3[i]||ans[fir[i]+j]<=lim||vis[y[fir[i]+j]])continue;
            las++;vis[y[fir[i]+j]]=1;
        }for(int j=fir[i]+1;j<=fir[i]+m;j++)vis[y[j]]=0;
        cout<<las<<'\n';
    }return 0;
}