#include<bits/stdc++.h>
#define pb emplace_back
#define mn(a, b) (dfn[a] < dfn[b] ? a : b)
using namespace std;
using ll = long long;
using db = double;

constexpr int MAXSIZE = 1 << 20;
char buf[MAXSIZE], *p1, *p2;
#define gc() getchar()//(p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, MAXSIZE, stdin), p1 == p2) ? EOF : *p1++)

int rd() {int x = 0, f = 1;char c = gc();while (!isdigit(c)) {if (c == '-') f = -1;c = gc();}while (isdigit(c)) x = x * 10 + (c ^ 48), c = gc();return x * f;}

const int N = 1e5 + 7;
int i, j, k, n, m, a, b, B;
int v[N], w[N], c[N], dep[N];
int st[N], sz, bl[N], bk, q;
int f[20][N], id, dfn[N], ft[N];
int cnt[N], vis[N];
vector<int> d[N];
struct qry {
	int x, y, t, id;
	bool operator < (const qry&z) const {return bl[x] == bl[z.x] ? (bl[y] == bl[z.y] ? t < z.t : bl[y] < bl[z.y]) : bl[x] < bl[z.x];}
} qr[N], ch[N];
int Qr, Ch;
ll res, ans[N];

void dfs(int a, int fa) {
	int k = sz;
	f[0][dfn[a] = ++id] = fa;
	dep[a] = dep[ft[a] = fa] + 1;
	for(int b : d[a]) if(b != fa) {
		dfs(b, a);
		if(sz - k > B) {
			++bk;
			while(sz != k) bl[st[sz--]] = bk;
		}
	}
	st[++sz] = a;
}

int lca(int x, int y) {
	if(x == y) return x;
	if((x = dfn[x]) > (y = dfn[y])) swap(x, y);
	int k = __lg(y - x++);
	return mn(f[k][x], f[k][y-(1<<k)+1]);
}

void ck(int x) {
	if(vis[x]) res -= w[cnt[c[x]]--] * v[c[x]];
	else res += w[++cnt[c[x]]] * v[c[x]];
	vis[x] ^= 1;
}

void upd(int x, int y) {
	while(x != y) {
		if(dep[x] < dep[y]) swap(x, y);
		ck(x), x = ft[x];
	}
}

void add(qry&k) {
	int x = k.x, y = k.y;
	if(vis[x]) ck(x), swap(k.y, c[x]), ck(x);
	else swap(k.y, c[x]);
}

signed main() {
	scanf("%d%d%d", &n, &m, &q);
	B = pow(n, 0.666);
	for(i = 1; i <= m; i++) scanf("%d", &v[i]);
	for(i = 1; i <= n; i++) scanf("%d", &w[i]);
	for(i = 1; i < n; i++) {
		scanf("%d%d", &a, &b);
		d[a].pb(b), d[b].pb(a);
	}
	for(i = 1; i <= n; i++) scanf("%d", &c[i]);
	dfs(1, 0);
	while(sz) bl[st[sz--]] = bk;
	for(j = 1; j <= __lg(n); j++) for(i = 1; i + (1 << j) - 1 <= n; i++)
		f[j][i] = mn(f[j-1][i], f[j-1][i+(1<<j-1)]);
	for(i = 1; i <= q; i++) {
		int o, x, y;
		scanf("%d%d%d", &o, &x, &y);
		if(o) {
			++Qr, qr[Qr] = {x, y, Ch, Qr};
		} else ch[++Ch] = {x, y, 0, 0};
	}
	sort(qr + 1, qr + 1 + Qr);
	int X = 1, Y = 1, T = 0;
	ck(1);
	for(i = 1; i <= Qr; i++) {
		int x = qr[i].x, y = qr[i].y, t = qr[i].t;
		upd(x, X), upd(y, Y);
		ck(lca(x, y)), ck(lca(X, Y));
		X = x, Y = y;
		while(T < t) add(ch[++T]);
		while(T > t) add(ch[T--]);
		ans[qr[i].id] = res;
	}
	for(i = 1; i <= Qr; i++) printf("%lld\n", ans[i]);
	return 0;
}