#include<cstdio>

#include<cstring>

#include<algorithm>

using namespace std;

typedef long long LL;

const int maxn = 1e6 + ;

int T, N, Q;

LL a[maxn], sum[maxn];

struct Edge

{

    int to, next;

    Edge (int to = , int next = ): to(to), next(next) {}

} E[maxn * ];

int head[maxn], tot;

void initEdge()

{

    for(int i = ; i <= N + ; i++) head[i] = -;

    tot = ;

}

void addEdge(int u, int v)

{

    E[tot] = Edge(v, head[u]);

    head[u] = tot++;

}

int L[maxn], R[maxn], dfs_clock;

void DFS(int u, int fa)

{

    L[u] = ++dfs_clock;

    sum[L[u]] = a[u] + sum[L[fa]];

    for(int k = head[u]; ~k; k = E[k].next)

    {

        int v = E[k].to;

        if(v == fa) continue;

        DFS(v, u);

    }

    R[u] = dfs_clock;

}

LL ma[maxn * ], fg[maxn * ];

void Build(int id, int L, int R)

{

    fg[id] = ;

    if(L == R)

    {

        ma[id] = sum[L];

        return ;

    }

    int mid = (L + R) >> ;

    Build(id << , L, mid);

    Build(id <<  | , mid + , R);

    ma[id] = max(ma[id << ], ma[id <<  | ]);

}

inline void push_down(int id)

{

    if(fg[id])

    {

        fg[id << ] += fg[id];

        ma[id << ] += fg[id];

        fg[id <<  | ] += fg[id];

        ma[id <<  | ] += fg[id];

        fg[id] = ;

    }

}

void update(int id, int L, int R, int l, int r, LL val)

{

    if(L == l && R == r)

    {

        fg[id] += val;

        ma[id] += val;

        return ;

    }

    push_down(id);

    int mid = (L + R) >> ;

    if(r <= mid)

        update(id << , L, mid, l, r, val);

    else if(l >= mid + )

        update(id <<  | , mid + , R, l, r, val);

    else

    {

        update(id << , L, mid, l, mid, val);

        update(id <<  | , mid + , R, mid + , r, val);

    }

    ma[id] = max(ma[id << ], ma[id <<  | ]);

}

LL query(int id, int L, int R, int l, int r)

{

    if(L == l && R == r)

        return ma[id];

    push_down(id);

    int mid = (L + R) >> ;

    if(r <= mid)

        return query(id << , L, mid, l, r);

    else if(l >= mid + )

        return query(id <<  | , mid + , R, l, r);

    else

    {

        LL t = query(id << , L, mid, l, mid);

        return max(t, query(id <<  | , mid + , R, mid + , r));

    }

}

int main ()

{

    int ic = ;

    scanf("%d", &T);

    while(T--)

    {

        scanf("%d %d", &N, &Q);

        initEdge();

        for(int i = ; i <= N - ; i++)

        {

            int u, v;

            scanf("%d %d", &u, &v);

            addEdge(u + , v + );

            addEdge(v + , u + );

        }

        for(int i = ; i <= N; i++) scanf("%lld", &a[i]);

        dfs_clock = , DFS(, );

        Build(, , N);

        printf("Case #%d:\n", ++ic);

        for(int i = ; i <= Q; i++)

        {

            int ty, x;

            LL y;

            scanf("%d", &ty);

            if(ty == )

            {

                scanf("%d %lld", &x, &y);

                x++;

                update(, , N, L[x], R[x], y - a[x]);

                a[x] = y;

            }

            else if(ty == )

            {

                scanf("%d", &x);

                x++;

                LL ans = query(, , N, L[x], R[x]);

                printf("%lld\n", ans);

            }

        }

    }

    return ;

}