#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<bitset>
#include<math.h>
#include<vector>
#include<string>
#include<stdio.h>
#include<cstring>
#include<iostream>
#include<algorithm>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
const int N=100010;
const int mod=100000000;
const int MOD1=1000000007;
const int MOD2=1000000009;
const double EPS=0.00000001;
typedef long long ll;
const ll MOD=1000000007;
const int MAX=1000000010;
const ll INF=1ll<<55;
const double pi=acos(-1.0);
typedef double db;
typedef unsigned long long ull;
int tot,u[N],v[2*N],pre[2*N];
void add(int a,int b) {
v[tot]=b;pre[tot]=u[a];u[a]=tot++;
}
int in[2*N],out[2*N];
void dfs(int x,int f) {
in[x]=++tot;
for (int i=u[x];i!=-1;i=pre[i])
if (v[i]==f) continue ;
else dfs(v[i],x);
out[x]=++tot;
}
ll x[2*N],sum[8*N],mx[8*N];
void build(int a,int l,int r) {
if (l==r) { sum[a]=mx[a]=x[l];return ; }
int mid=(l+r)>>1;
build(a<<1,l,mid);
build(a<<1^1,mid+1,r);
sum[a]=sum[a<<1]+sum[a<<1^1];
mx[a]=max(mx[a<<1],sum[a<<1]+mx[a<<1^1]);
}
void change(int a,int l,int r,int w,int b) {
if (l==w&&r==w) { sum[a]=mx[a]=b;return ; }
int mid=(l+r)>>1;
if (w<=mid) change(a<<1,l,mid,w,b);
else change(a<<1^1,mid+1,r,w,b);
sum[a]=sum[a<<1]+sum[a<<1^1];
mx[a]=max(mx[a<<1],sum[a<<1]+mx[a<<1^1]);
}
ll query(int a,int l,int r,int L,int R) {
if (l==L&&r==R) return mx[a];
int mid=(l+r)>>1;
if (R<=mid) return query(a<<1,l,mid,L,R);
else if (L>mid) return sum[a<<1]+query(a<<1^1,mid+1,r,L,R);
else return max(query(a<<1,l,mid,L,mid),sum[a<<1]+query(a<<1^1,mid+1,r,mid+1,R));
}
int main()
{
int a,b,i,n,m,t,ca;
ll y;
scanf("%d", &t);
for (ca=1;ca<=t;ca++) {
scanf("%d%d", &n, &m);
tot=0;memset(u,-1,sizeof(u));
for (i=1;i<n;i++) {
scanf("%d%d", &a, &b);
a++;b++;add(a,b);add(b,a);
}
tot=0;dfs(1,1);
for (i=1;i<=n;i++) {
scanf("%I64d", &y);
x[in[i]]=y;x[out[i]]=-y;
}
build(1,1,2*n);
printf("Case #%d:\n", ca);
while (m--) {
scanf("%d", &a);
if (a) {
scanf("%d", &b);b++;
printf("%I64d\n", query(1,1,2*n,in[b],out[b]-1));
} else {
scanf("%d%d", &a, &b);
a++;change(1,1,2*n,in[a],b);
change(1,1,2*n,out[a],-b);
}
}
}
return 0;
}