#pragma GCC optimize(2)
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
//#define int long long
//?????
using namespace std;
inline int read()
{
    char c=getchar();int x=0;bool f=0;
    for(;!isdigit(c);c=getchar())f^=!(c^45);
    for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
    if(f)x=-x;return x;
}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 200005
#define inf 0x3f3f3f3f

int n,m,Q,ff[maxn],orz[maxn];

int c[maxn];
ll val[maxn];
int fa[maxn];
int getf(int x){
    while(x^ff[x])x=ff[x]=ff[ff[x]];
    return x;
}

vi e[maxn];

struct node{
    int u,v,w;
    bool operator <(const node&b)const{return w<b.w;}
}a[maxn];

int anc[maxn][19],dep[maxn],dfn[maxn],que[maxn],out[maxn],idx;
void dfs(int u){
//    cout<<"dfs "<<u<<endl;
    anc[u][0]=fa[u];
    dep[u]=dep[fa[u]]+1;
    dfn[u]=++idx,que[idx]=u;
    For(i,1,18)anc[u][i]=anc[anc[u][i-1]][i-1];
    for(auto v:e[u])dfs(v);
    out[u]=idx;
}
int jump(int x,int k){
    Rep(i,18,0)
        if(anc[x][i] && val[anc[x][i]]<=k)
            x=anc[x][i];
    return x;
}
int lca(int u,int v){
    if(dep[u]<dep[v])swap(u,v);
    Rep(i,18,0)if(dep[anc[u][i]]>=dep[v])u=anc[u][i];
    if(u==v)return u;
    Rep(i,18,0)if(anc[u][i]^anc[v][i])u=anc[u][i],v=anc[v][i];
    return anc[u][0];
}

vi p[maxn];
bool dfncmp(int x,int y){return dfn[x]<dfn[y];}

ll tr[maxn];//tmp[maxn];
inline void add(int x,int y){
 //   tmp[x]+=y;
    for(;x<=idx;x+=x&-x)tr[x]+=y;
}
inline ll askpre(int x){
    ll res=0;
    for(;x;x^=x&-x)res+=tr[x];
    return res;
}
inline ll ask(int u){return askpre(out[u])-askpre(dfn[u]-1);}

void Out(){
//    For(i,1,n*2-1)cout<<tmp[dfn[i]]<<" \n"[i==n*2-1];
}

int st[maxn],top;
struct T{
    map<int,int>mp;
    vector<vi>g;
    vi up;
    vi to_u;
    vector<ll> f;
    int id(int u){
        if(!mp.count(u)){
            int o=mp.size();
            f.pb(0),up.pb(0),g.pb({}),to_u.pb(u);
            return mp[u]=o+1;
        }return mp[u];
    }
    
    void adde(int u,int v){
    //    cout<<"ADD "<<u<<" "<<v<<endl;
        u=id(u),v=id(v);
        g[u].pb(v);
        up[v]=u;
    }
    void init(int c){
        mp.clear();
        g.resize(1),f.resize(1),up.resize(1),to_u.resize(1);
        vi o=p[c];
        sort(o.begin(),o.end(),dfncmp);
        top=0;
        for(auto u:o){
            if(!top){st[++top]=u;continue;}
            int l=lca(u,st[top]),pre=0;
            while(top && dep[l]<=dep[st[top]]){
                if(pre) adde(st[top],pre);
                pre=st[top],--top;
            }
            if(pre && l!=pre) adde(l,pre);
            st[++top]=l;
            if(st[top]!=u) st[++top]=u;
        }
        while(top>1) adde(st[top-1],st[top]),--top;
    //    For(i,1,mp.size())
    //        cout<<up[i]<<" "<<to_u[i]<<endl;puts("-----");
    }
    inline void addx(int u,int x){
    //    cout<<"u: "<<u<<endl;
        u=to_u[u];
    //    cout<<"addx "<<u<<" "<<x<<endl;
        add(dfn[u],x);
    }
    void upd(int u,int x){
        u=id(u);
        f[u]+=x;
        addx(u,x);
        if(up[u]) addx(up[u],-x);
        ll now=f[u];
        while(up[u]){
        //    cout<<u<<" -> "<<up[u]<<endl;
            u=up[u];
            if(now<=f[u])break;
            ll delt=now-f[u]; f[u]=now;
            addx(u,delt);
            if(up[u]) addx(up[u],-delt);
        }
    }
    void dele(){
        mp.clear();
        g.resize(1),f.resize(1),up.resize(1),to_u.resize(1);
    }
}t[maxn];

void updata(int u,int x){t[c[u]].upd(u,x);}

void work()
{
    n=read(),m=read(),Q=read();
    
    idx=0;
    For(i,1,n*2)ff[i]=i,e[i].clear(),p[i].clear(),fa[i]=val[i]=tr[i]=0;
    
    For(i,1,n)c[i]=read(),p[c[i]].pb(i);
    For(i,1,n)orz[i]=read();
    
    For(i,1,m)a[i].u=read(),a[i].v=read(),a[i].w=read();
    sort(a+1,a+m+1);
    int np=n;
    For(i,1,m){
        int u=a[i].u,v=a[i].v;
        if(getf(u)==getf(v))continue;
        u=getf(u),v=getf(v);
        fa[u]=fa[v]=++np;
        ff[u]=ff[v]=np; 
        e[fa[u]].pb(u),e[fa[v]].pb(v),val[fa[u]]=a[i].w;
    }
    dfs(np);
//    For(i,1,n)For(j,1,n)cout<<lca(i,j)<<" \n"[j==n]; 
//    puts("done");
    
    For(i,1,n)
        if(p[i].size()) t[i].init(i);
//    puts("done2");

    For(i,1,n) updata(i,orz[i]);
//    Out();
    For(_,1,Q){
        int o=read(),x=read(),y=read();
        if(o==0) updata(x,y),val[x]+=y;
        else {
            int u=jump(x,y);
            printf("%lld\n",ask(u));
        }
    }
    
    For(i,1,n)
        if(p[i].size()) t[i].dele();
}

signed main()
{
//    freopen("data.in","r",stdin);
//    freopen("my.out","w",stdout);
    int T=read();
    while(T--)work();
    return 0;
}