传送门
题解:
首先我们发现树形背包的方程其实是很好列出来的。
直接用FWT之后的数组做就行了。
代码:
#include<bits/stdc++.h>
#define ll long long
#define re register
#define gc get_char
#define cs const
namespace IO{
inline char get_char(){
static cs int Rlen=1<<22|1;
static char buf[Rlen],*p1,*p2;
return (p1==p2)&&(p2=(p1=buf)+fread(buf,1,Rlen,stdin),p1==p2)?EOF:*p1++;
}
template<typename T>
inline T get(){
char c;
while(!isdigit(c=gc()));T num=c^48;
while(isdigit(c=gc()))num=(num+(num<<2)<<1)+(c^48);
return num;
}
inline int getint(){return get<int>();}
}
using namespace IO;
using std::cerr;
using std::cout;
cs int mod=1e9+7;
inline int add(int a,int b){return (a+=b)>=mod?a-mod:a;}
inline int dec(int a,int b){return (a-=b)<0?a+mod:a;}
inline int mul(int a,int b){static ll r;r=(ll)a*b;return r>=mod?r%mod:r;}
inline int power(int a,int b,int res=1){
for(;b;b>>=1,a=mul(a,a))(b&1)&&(res=mul(res,a));
return res;
}
inline void Inc(int &a,int b){(a+=b)>=mod&&(a-=mod);}
inline void Dec(int &a,int b){(a-=b)<0&&(a+=mod);}
cs int N=1e3+3,M=1<<10|1;
int n,S,inv;
int f[N][M];
int ans[M];
inline void FWT(int *A){
for(int re i=1;i<S;i<<=1)
for(int re j=0;j<S;j+=i<<1)
for(int re k=0;k<i;++k){
int x=A[j|k],y=A[j|k|i];
A[j|k]=add(x,y),A[j|k|i]=dec(x,y);
}
}
inline void IFWT(int *A){
FWT(A);for(int re i=0;i<S;++i)A[i]=mul(A[i],inv);
}
std::vector<int> G[N];
void dfs(int u,int p=0){
for(int re v:G[u])if(v!=p){
dfs(v,u);
for(int re i=0;i<S;++i)f[u][i]=mul(f[u][i],f[v][i]);
}
IFWT(f[u]),Inc(f[u][0],1),FWT(f[u]);
}
inline void solve(){
n=getint(),S=getint(),inv=power(S,mod-2);
for(int re i=1;i<=n;++i)f[i][getint()]=1,FWT(f[i]);
for(int re i=1;i<n;++i){
int u=getint(),v=getint();
G[u].push_back(v);
G[v].push_back(u);
}
dfs(1);
for(int re i=1;i<=n;++i)IFWT(f[i]),Dec(f[i][0],1);
for(int re j=1;j<=n;++j)
for(int re i=0;i<S;++i)Inc(ans[i],f[j][i]);
for(int re i=0;i<S;++i,cout<<(i==S?'\n':' '))cout<<ans[i];
}
inline void init(){
for(int re i=1;i<=n;++i){
G[i].clear();
memset(f[i],0,sizeof(int)*S);
}
memset(ans,0,sizeof(int)*S);
}
signed main(){
#ifdef zxyoi
freopen("treecut.in","r",stdin);
#endif
int T=getint();while(T--)init(),solve();
return 0;
}