#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
const int N=100005;
typedef long long ll;
int read()
{int x=0,f=1;char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9')x=x*10+ch-'0',ch=getchar();return x*f;
}
int to[N<<1],nxt[N<<1],tot,head[N],num[N],sum[N],dep[N];
int dt[N];
int T,n,op;
int dp[N];
void add(int x,int y)
{to[++tot]=y;nxt[tot]=head[x];head[x]=tot;
}
void pre(int x,int deep)
{sum[x]=num[x];dep[x]=deep;for(int i=head[x];i;i=nxt[i]){int y=to[i];if(dep[y]||y==1)continue;pre(y,deep+1);sum[x]+=sum[y];}
}
void dfs(int x)
{for(int i=head[x];i;i=nxt[i]){int y=to[i];if(dep[y]<dep[x])continue;dp[y]=dp[x]-sum[y]+sum[1]-sum[y];dfs(y);}
}
void DFS(int x,int f)
{for(int i=head[x];i;i=nxt[i]){int y=to[i];if(y==f)continue;dt[y]=dp[y]-dp[x];DFS(y,x);}
}
void cacl()
{for(int i=1;i<=n;i++)num[i]=read();pre(1,0);for(int i=1;i<=n;i++)dp[1]+=dep[i]*num[i];dfs(1);for(int i=1;i<=n;i++)printf("%d ",dp[i]);printf("\n");
}
void getans(int x,int f)
{ll ssum=0;for(int i=head[x];i;i=nxt[i]){int y=to[i];if(y==f)continue;getans(y,x);ssum+=sum[y];}num[x]=sum[x]-ssum;
}
void solve()
{for(int i=1;i<=n;i++)dp[i]=read();DFS(1,0);ll total=0;for(int i=2;i<=n;i++)total+=1LL*dt[i];sum[1]=1LL*(dp[1]*2+total)/(n-1);for(int i=2;i<=n;i++)sum[i]=(-dt[i]+sum[1])/2;getans(1,0);for(int i=1;i<=n;i++)printf("%d ",num[i]);printf("\n");
}
void ini()
{for(int i=1;i<=n*2;i++){to[i]=nxt[i]=0;if(i<=n)dp[i]=dt[i]=head[i]=sum[i]=num[i]=dep[i]=0;}tot=0;
}
void work()
{n=read();ini();for(int i=1;i<n;i++){int x=read(),y=read();add(x,y);add(y,x);}op=read();if(op)solve();else cacl();
}
int main()
{T=read();while(T--)work();return 0;
}

1
6
1 2
1 3
2 4
2 5
3 6
0
4 2 3 5 6 11
6
1 2
1 3
2 4
2 5
3 6
1
29 24 42 35 33 61