#include<bits/stdc++.h>
#define vectorwyx maze
namespace vectorwyx{
#define pii pair<int,int>
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define mk make_pair
#define sml(x,y) (x=min(x,y))
#define big(x,y) (x=max(x,y))
#define ll long long
#define uint unsigned
#define ull unsigned long long
#define umap unordered_map
#define db double
#define fo(i,x,y) for(int i=(x);i<=(y);++i)
#define go(i,x,y) for(int i=(x);i>=(y);--i)
#define ptc putchar
#define gtc getchar
#define emp emplace
#define re return
#define co continue
#define brk break
#define HH (ptc('\n'))
#define bctz __builtin_ctz
#define bclz __builtin_clz
#define bppc __builtin_popcount
using namespace std;
ll seed=chrono::system_clock::now().time_since_epoch().count();
mt19937 rnd(seed);
inline int rm(int x,int y){return (int)(rnd()%(y-x+1ll)+x);}
inline int read(){signed ch=getchar();int x=0,f=1;while(!isdigit(ch)){if(ch==(int)('-'))f=-1;ch=getchar();}while(isdigit(ch)){x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}return x*f;}
template<typename T> void out(T *a,int l,int r){fo(i,l,r) cout<<*(a+i)<<' ';puts("");}

const int N=1005;
const ll inf=1e18;
ll a[N];
vector<int> e[N];
int n,dL[N],dR[N],ti,dis[N][N],dod[N];

void dfs1(int x,int fa){
    dL[x]=++ti;dod[ti]=x;
    for(int i:e[x]) if(i!=fa) dfs1(i,x);
    dR[x]=ti;
}

void dfs2(int x,int fa,int Rt){
    for(int i:e[x]) if(i!=fa) dis[Rt][i]=dis[Rt][x]+1,dfs2(i,x,Rt);
}

void solve(){
    cin>>n;int q=read();ti=0;
    assert(n<N);
    fo(i,1,n) e[i].clear();
    fo(i,1,n) cin>>a[i];
    fo(i,2,n){
        int x=read(),y=read();
        e[x].pb(y),e[y].pb(x);
    }
    dfs1(1,0);
    fo(i,1,n) dis[i][i]=0,dfs2(i,0,i);
    while(q--){
        int o=read(),x=read();
        ll ans=-inf;
        if(o==3){
            int v=read();
            fo(i,dL[x],dR[x]){
                int k=dod[i];
                a[k]+=v;
                big(ans,a[k]);
            }
            cout<<ans<<'\n';
            co;
        }
        int k=read(),v=read();
        fo(i,1,n) if((o==1&&dis[x][i]==k)||(o==2&&dis[x][i]<=k)) a[i]+=v,big(ans,a[i]);
        cout<<ans<<'\n';
    }
}

signed main(){
    int T=read();
    while(T--) solve();
    return 0;
}
}
/*
-------------------------------------------------
*/










signed main(){re vectorwyx::main();}