#pragma comment(linker, "/STACK:1024000000,1024000000") 
#include<cstdio>
#include<cstring>
#include<stdlib.h>
#include<algorithm>
#include<iostream>
#include<cmath>
#include<map>
#define CLR(a,b) memset(a,b,sizeof(a))
#define PI acos(-1)
#define lson rt*2,l,(l+r)/2
#define rson rt*2+1,(l+r)/2+1,r
using namespace std;
typedef long long ll;
const int inf=0x3f3f3f3f;
const int maxn=100010;
struct edge{
    int to,Next;
}e[maxn*2];
int tot,m,n,head[maxn],pos,dfn[maxn],fa[maxn],son[maxn],l[maxn],r[maxn];
ll val[maxn],dis[maxn];
inline void init(){
    CLR(head,-1),tot=0,pos=0;
    CLR(dis,0);
    fa[1]=1;
}
inline void addv(int u,int v){
    e[++tot]={v,head[u]};
    head[u]=tot;
}
ll tree[maxn << 2], laz[maxn << 2];
inline void pushup(int rt) {
    tree[rt] = max(tree[rt << 1], tree[rt << 1 | 1]);
}
inline void pushdown(int rt) {
    if (laz[rt]) {
        tree[rt << 1] += laz[rt];
        tree[rt << 1 | 1] += laz[rt];
        laz[rt << 1] += laz[rt];
        laz[rt << 1 | 1] += laz[rt];
        laz[rt] = 0;
    }
}
inline void build(int rt, int l, int r) {
    laz[rt] = 0;
    if (l == r) {
        tree[rt] = dis[l];
        return ;
    }
    build(lson);
    build(rson);
    pushup(rt);
}
inline void update(int L, int R, ll v, int rt, int l, int r) {
    if (L <= l && R >= r) {
        tree[rt] += v;
        laz[rt] += v;
        return;
    }
    pushdown(rt);
    if (L <= (l + r) / 2)   update(L, R, v, lson);
    if (R > (l + r) / 2)    update(L, R, v, rson);
    pushup(rt);
}
inline ll query(int L, int R, int rt, int l, int r) { 
    if (L <= l && R >= r) {
        return tree[rt];
    }
    pushdown(rt);
    if (L > (l + r) / 2)    return query(L,R,rson);
    else if (R <= (l + r) / 2)  return query(L,R,lson);
    else return max(query(L,R,lson),query(L,R,rson));
}

inline void dfs(int u,int pre){
    dfn[u]=++pos;
    l[u]=pos;
    son[u]=1;
    dis[dfn[u]]=dis[dfn[pre]]+val[u];
    for(int i=head[u];i!=-1;i=e[i].Next)
    {
        int v=e[i].to;
        if(v==fa[u])continue;
        fa[v]=u;
        
        dfs(v,u);
        son[u]+=son[v];
    }
    r[u]=pos;
}
int main(){
    int T,cas=1;
    cin>>T;
    while(T--){
        init();
        scanf("%d%d",&n,&m);
        
        for(int i=1;i<n;i++){
            int u,v;
            scanf("%d%d",&u,&v);
            addv(u+1,v+1);
            addv(v+1,u+1);
        }
        
        for(int i=1;i<=n;i++)scanf("%lld",&val[i]);
        dfs(1,1);
        build(1,1,n);
        printf("Case #%d:\n",cas++);
        while(m--){
            int op,x;ll y;
            scanf("%d%d",&op,&x);
            if(op==1){
            //    printf("debug  %d  %d\n",dfn[x+1],dfn[x+1]+son[x+1]-1);
            
                printf("%lld\n",query(l[x+1],r[x+1],1,1,n));
            }else{
                scanf("%lld",&y);
                update(l[x+1],r[x+1],y-val[x+1],1,1,n);
                val[x+1]=y;
            }
        }
        
    }
}