#include<cmath>
#include<cstdio>
#include<algorithm>
#define N 100001
using namespace std;
int n,m,q,siz;
int tasty[N],curious[N],type[N];
int front[N],to[N<<1],nxt[N<<1],tot;
int now,cnt,block[N],sum[N];
int son[N],deep[N],dfn[N],bl[N],fa[N];
long long tmp,ans[N];
bool v[N];
struct QUERY
{int l,r,id,tim;bool operator < (QUERY p)const{if(block[l]!=block[p.l]) return block[l]<block[p.l];if(block[r]!=block[p.r]) return block[r]<block[p.r];return tim<p.tim;}
}e[N];
struct CHANGE
{int pos,be,af;
}g[N];
void read(int &x)
{x=0; char c=getchar();while(c<'0'||c>'9') c=getchar();while(c>='0'&&c<='9') { x=x*10+c-'0'; c=getchar(); }
}
void out(long long x)
{if(x/10) out(x/10);putchar(x%10+'0');
}
void add(int u,int v)
{to[++tot]=v; nxt[tot]=front[u]; front[u]=tot;to[++tot]=u; nxt[tot]=front[v]; front[v]=tot;
}
void init()
{read(n); read(m); read(q);siz=sqrt(n);for(int i=1;i<=m;i++) read(tasty[i]);for(int i=1;i<=n;i++) read(curious[i]);int u,v;for(int i=1;i<n;i++){read(u); read(v);add(u,v);}for(int i=1;i<=n;i++) read(type[i]);int w;tot=0;for(int i=1;i<=q;i++){scanf("%d%d%d",&w,&u,&v);if(!w){g[++now].pos=u; g[now].af=v;}else{e[++cnt].l=u; e[cnt].r=v; e[cnt].id=cnt; e[cnt].tim=now;}}
}
void dfs1(int x)
{son[x]++;for(int i=front[x];i;i=nxt[i]){if(to[i]==fa[x]) continue;deep[to[i]]=deep[x]+1;fa[to[i]]=x;dfs1(to[i]);son[x]+=son[to[i]];}
}
void dfs2(int x,int top)
{dfn[x]=++tot;bl[x]=top;block[x]=(tot-1)/siz+1;int y=0;for(int i=front[x];i;i=nxt[i]){if(to[i]==fa[x]) continue;if(son[to[i]]>son[y]) y=to[i];}if(!y) return;dfs2(y,top);for(int i=front[x];i;i=nxt[i]){if(to[i]==fa[x]||to[i]==y) continue;dfs2(to[i],to[i]);}
}
int get_lca(int u,int v)
{while(bl[u]!=bl[v]){if(deep[bl[u]]<deep[bl[v]]) swap(u,v);u=fa[bl[u]];}if(deep[u]>deep[v]) swap(u,v);return u;
}
void point(int x)
{if(v[x])  {long long o=curious[sum[type[x]]--];tmp-=1ll*tasty[type[x]]*o;}else {long long o=curious[++sum[type[x]]];tmp+=1ll*tasty[type[x]]*o;}v[x]^=1;
}
void path(int u,int v)
{while(u!=v){if(deep[u]<deep[v]) point(v),v=fa[v];else point(u),u=fa[u];}
}
void solve()
{int L=1,R=1,lca; now=0;for(int i=1;i<=cnt;i++){while(now<e[i].tim){now++;g[now].be=type[g[now].pos];if(v[g[now].pos]){point(g[now].pos);type[g[now].pos]=g[now].af;point(g[now].pos);}else  type[g[now].pos]=g[now].af;}while(now>e[i].tim){if(v[g[now].pos]){point(g[now].pos);type[g[now].pos]=g[now].be;point(g[now].pos);}else type[g[now].pos]=g[now].be;now--;    }if(dfn[e[i].l]>dfn[e[i].r]) swap(e[i].l,e[i].r);path(L,e[i].l);path(R,e[i].r);lca=get_lca(e[i].l,e[i].r);point(lca);ans[e[i].id]=tmp;point(lca);L=e[i].l; R=e[i].r;//printf("%d %d:",e[i].l,e[i].r);//printf("%I64d\n",tmp);
    }for(int i=1;i<=cnt;i++) out(ans[i]),puts("");
}
int main()
{init();dfs1(1);dfs2(1,1);sort(e+1,e+cnt+1);solve();
}

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<set>
#include<ctime>
#include<queue>
#include<cmath>
#include<algorithm>
#define inf 1000000000
#define ll long long
using namespace std;
int read()
{int x=0,f=1;char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}return x*f;
}
ll ans,res[100005];
int bin[20];
int n,m,Q,ind,cnt,top;
int blo,blonum;
ll V[100005],W[100005],C[100005],pre[100005];
int fa[100005][17];
int last[100005],q[100005],deep[100005],belong[100005],dfn[100005];
int num[100005];
bool vis[100005];
struct edge{int to,next;}e[200005];
struct query{int x,y,t,id;}b[100005];
struct change{int x,y,t,pre;}c[100005];
bool operator<(query a,query b)
{if(belong[a.x]==belong[b.x]&&belong[a.y]==belong[b.y])return a.t<b.t;else if(belong[a.x]==belong[b.x])return belong[a.y]<belong[b.y];else return belong[a.x]<belong[b.x];
}
void insert(int u,int v)
{e[++cnt].to=v;e[cnt].next=last[u];last[u]=cnt;e[++cnt].to=u;e[cnt].next=last[v];last[v]=cnt;
}
int dfs(int x)
{int size=0;dfn[x]=++ind;for(int i=1;i<=16;i++)if(deep[x]>=bin[i])fa[x][i]=fa[fa[x][i-1]][i-1];else break;for(int i=last[x];i;i=e[i].next)if(e[i].to!=fa[x][0]){deep[e[i].to]=deep[x]+1;fa[e[i].to][0]=x;size+=dfs(e[i].to);if(size>=blo){blonum++;for(int k=1;k<=size;k++)belong[q[top--]]=blonum;size=0;}}q[++top]=x;return size+1;
}
int lca(int x,int y)
{if(deep[x]<deep[y])swap(x,y);int t=deep[x]-deep[y];for(int i=0;bin[i]<=t;i++)if(bin[i]&t)x=fa[x][i];for(int i=16;i>=0;i--)if(fa[x][i]!=fa[y][i])x=fa[x][i],y=fa[y][i];if(x==y)return x;return fa[x][0];
}
void reverse(int x)
{if(vis[x])ans-=W[num[C[x]]]*V[C[x]],num[C[x]]--;else num[C[x]]++,ans+=W[num[C[x]]]*V[C[x]];vis[x]^=1;
}
void change(int x,int y)
{if(vis[x]){reverse(x);C[x]=y;reverse(x);}else C[x]=y;
}
void solve(int x,int y)
{while(x!=y){if(deep[x]>deep[y])reverse(x),x=fa[x][0];else reverse(y),y=fa[y][0];}
}
int main()
{bin[0]=1;for(int i=1;i<20;i++)bin[i]=bin[i-1]<<1;n=read();m=read();Q=read();blo=pow(n,2.0/3)*0.5;for(int i=1;i<=m;i++)V[i]=read();for(int i=1;i<=n;i++)W[i]=read();for(int i=1;i<n;i++){int u=read(),v=read();insert(u,v);}for(int i=1;i<=n;i++)pre[i]=C[i]=read();dfs(1);while(top)belong[q[top--]]=blonum;int c1=0,c2=0;for(int i=1;i<=Q;i++){int typ=read(),x=read(),y=read();if(!typ){c1++;c[c1].x=x;c[c1].y=y;c[c1].pre=pre[x];pre[x]=y;}else {c2++;if(dfn[x]>dfn[y])swap(x,y);b[c2].x=x;b[c2].y=y;b[c2].id=c2;b[c2].t=c1;}}sort(b+1,b+c2+1);for(int i=1;i<=b[1].t;i++)change(c[i].x,c[i].y);solve(b[1].x,b[1].y);int t=lca(b[1].x,b[1].y);reverse(t);res[b[1].id]=ans;reverse(t);for(int i=2;i<=c2;i++){for(int j=b[i-1].t+1;j<=b[i].t;j++)change(c[j].x,c[j].y);for(int j=b[i-1].t;j>b[i].t;j--)change(c[j].x,c[j].pre);solve(b[i-1].x,b[i].x);solve(b[i-1].y,b[i].y);int t=lca(b[i].x,b[i].y);reverse(t);res[b[i].id]=ans;reverse(t);}for(int i=1;i<=c2;i++)printf("%lld\n",res[i]);return 0;
}