#include <bits/stdc++.h>
using namespace std;
typedef long long i64; 
const int BLOCK_SIZE = 500; 

int n, q, C, LL, RR; 
int a[250005], c[250005], aa[250005], cc[250005];
int L[505], R[505], vis[250005], cnt[250005]; 
i64 ans[250005]; 
struct Query {
    int op, l, r, x, y;
} Q[250005]; 

int main(void) {
    scanf("%d%d%d", &n, &q, &C); int t = (n - 1) / BLOCK_SIZE + 1; 
    for (int i = 1; i <= t; ++i) L[i] = R[i - 1] + 1, R[i] = i * BLOCK_SIZE; R[t] = n; 
    for (int i = 1; i <= n; ++i) scanf("%d", a + i); 
    for (int i = 1; i <= n; ++i) scanf("%d", c + i), cc[i] = i; 
    for (int i = 1; i <= q; ++i) {
        scanf("%d%d%d", &Q[i].op, &Q[i].l, &Q[i].r); 
        if (Q[i].op != 3) scanf("%d%d", &Q[i].x, &Q[i].y); 
    }
    for (int k = 1; k <= t; ++k) {
        LL = L[k], RR = R[k]; i64 res = 0;
        memset(cnt, 0, sizeof cnt); 
        for (int i = LL; i <= RR; ++i) ++cnt[c[i]], res += a[i]; 
        for (int i = 1; i <= q; ++i) {
            int op = Q[i].op, l = Q[i].l, r = Q[i].r, x = Q[i].x, y = Q[i].y;
            if (r < LL || l > RR) continue; 
            if (l <= LL && RR <= r) {
                if (op == 1) cnt[y] += cnt[x], cnt[x] = 0; 
                else if (op == 2) res += 1ll * cnt[x] * y; 
                else ans[i] += res; 
            } else {
                int bl = max(l, LL), br = min(r, RR); vis[i] = k; 
                vector<int> bin; 
                for (int j = i - 1; j >= 1; --j) {
                    if (vis[j] == k) break; vis[j] = k; 
                    if (Q[j].r < LL || Q[j].l > RR) continue; 
                    if (Q[j].op == 1) {
                        aa[Q[j].x] = aa[Q[j].y]; // x 颜色改成 y，x 
                        cc[Q[j].x] = cc[Q[j].y]; 
                    } else if (Q[j].op == 2) {
                        aa[Q[j].x] += Q[j].y; 
                    }
                    bin.push_back(Q[j].x); 
                }
                for (int j = bl; j <= br; ++j) a[j] += aa[c[j]], c[j] = cc[c[j]]; 
                for (int x : bin) aa[x] = 0, cc[x] = x; 
                if (op == 1) {
                    for (int j = bl; j <= br; ++j)
                        if (c[j] == x) c[j] = y, --cnt[x], ++cnt[y]; 
                } else if (op == 2) {
                    for (int j = bl; j <= br; ++j)
                        if (c[j] == x) a[j] += y, res += y; 
                } else {
                    for (int j = bl; j <= br; ++j)
                        ans[i] += a[j]; 
                }
            }
        }
    }
    for (int i = 1; i <= q; ++i) if (Q[i].op == 3) printf("%lld\n", ans[i]); 
    return 0; 
}