#include <bits/stdc++.h>

using namespace std;

#define fo(i, x, y) for(int i = x, endI = y; i <= endI; ++ i)

#define N 300000

void read(int &);

typedef long long ll;

// 二分求位置线段树数组及动态开点变量 queryTree
int sz[N << 6], ls[N << 6], rs[N << 6], fa[N << 6], rt[N + 1];

int totTreePoints;

// 计算区间和线段树数组 sumTree
ll sv[N << 6];

// 用于记录询问信息
int a[25][N + 1];

// 输入
int c[N + 1], val[N + 1];

int n, m;

void buildSumTree(int t, int l, int r) {
    if (l == r) {
        sv[t] = val[l];
        return;
    }
    int mid = l + r >> 1;
    buildSumTree(t << 1, l, mid),
    buildSumTree(t << 1 | 1, mid + 1, r);
    sv[t] = sv[t << 1] + sv[t << 1 | 1];
}

void addQueryTree(int &t, int l, int r, int k, int f, int adder) {
    if (! t) {
        t = ++ totTreePoints;
        ls[t] = rs[t] = sz[t] = 0;
        fa[t] = f;
    }
    sz[t] += adder;
    if (l == r)
        return;
    int mid = l + r >> 1;
    k <= mid ? addQueryTree(ls[t], l, mid, k, t, adder) : addQueryTree(rs[t], mid + 1, r, k, t, adder);
}

void addSumTree(int t, int l, int r, int k, int adder) {
    sv[t] += adder;
    if (l == r)
        return;
    int mid = l + r >> 1;
    k <= mid ? addSumTree(t << 1, l, mid, k, adder) : addSumTree(t << 1 | 1, mid + 1, r, k, adder);
}

int queryLeft(int t, int l, int r, int k, int d) {
    if (l == r) {
        fo(i, 1, t) if (sz[a[d][i]])
            return l;
        return 0;
    }
    int mid = l + r >> 1;
    int point = 0;
    if (k > mid) {
        fo(i, 1, t) a[d + 1][i] = rs[a[d][i]];
        point = queryLeft(t, mid + 1, r, k, d + 1);
        if (point == mid + 1) {
            fo(i, 1, t) a[d + 1][i] = ls[a[d][i]];
            int point1 = queryLeft(t, l, mid, k, d + 1);
            if (point1)
                point = point1;
        }
    } else {
        fo(i, 1, t) a[d + 1][i] = ls[a[d][i]];
        point = queryLeft(t, l, mid, k, d + 1);
    }
    return point;
}

int queryRight(int t, int l, int r, int k, int d) {
    if (l == r) {
        fo(i, 1, t) if (sz[a[d][i]])
            return l;
        return 0;
    }
    int mid = l + r >> 1;
    int point = 0;
    if (k <= mid) {
        fo(i, 1, t) a[d + 1][i] = ls[a[d][i]];
        point = queryRight(t, l, mid, k, d + 1);
        if (point == mid) {
            fo(i, 1, t) a[d + 1][i] = rs[a[d][i]];
            int point1 = queryRight(t, mid + 1, r, k, d + 1);
            point =  point1 ? point1 : point;
        }
    } else {
        fo(i, 1, t) a[d + 1][i] = rs[a[d][i]];
        point = queryRight(t, mid + 1, r, k, d + 1);
    }
    return point;
}

ll calcSum(int t, int l, int r, int x, int y) {
    if (x <= l && r <= y)
        return sv[t];
    int mid = l + r >> 1;
    ll sumVal = 0;
    if (x <= mid)
        sumVal = calcSum(t << 1, l, mid, x, y);
    if (y > mid)
        sumVal += calcSum(t << 1 | 1, mid + 1, r, x, y);
    return sumVal;
}

int main() {
    int T; read(T);
    while (T--) {
        read(n), read(m);
        fo(i, 1, n) read(c[i]);
        fo(i, 1, n) read(val[i]);

        // 多组数据初始化
        // 清零
        totTreePoints = 0;
        fo(i, 1, n) rt[i] = 0;
        // 初始化
        buildSumTree(1, 1, n);
        fo(i, 1, n)
            addQueryTree(rt[c[i]], 1, n, i, 0, 1);

        fo(i, 1, m) {
            int opt, p, x;
            read(opt), read(p), read(x);
            if (opt == 1) {
                addQueryTree(rt[c[p]], 1, n, p, 0, -1);
                c[p] = x;
                addQueryTree(rt[x], 1, n, p, 0, 1);
            } else if (opt == 2) {
                addSumTree(1, 1, n, p, x - val[p]);
                val[p] = x;
            } else {
                fo(i, 1, x) read(a[0][i]), a[1][i] = rt[a[0][i]];
                int leftPoint = queryLeft(x, 1, n, p, 1);
                int rightPoint = queryRight(x, 1, n, p, 1);
                printf("%lld\n", calcSum(1, 1, n, leftPoint, rightPoint));
            }
        }
    }

    return 0;
}

void read(int &x) {
    char ch = getchar(); x = 0;
    while (ch < '0' || ch > '9') ch = getchar();
    while (ch >= '0' && ch <= '9') x = (x << 1) + (x << 3) + ch - 48, ch = getchar();
}