fwt优化+树形DP HDU 5909

//fwt优化+树形DP HDU 5909
//见官方题解
// BestCoder Round #88 http://bestcoder.hdu.edu.cn/

#include 
// #include 
// #include 
// #include 
// #include 
// #include 
// #include 
// #include 
using namespace std;
#define LL long long
typedef pair<int,int> pii;
const int inf = 0x3f3f3f3f;
const int MOD =1e9+7;
const int N =1e3+50;
#define clc(a,b) memset(a,b,sizeof(a))
const double eps = 1e-8;
void fre() {freopen("in.txt","r",stdin);}
void freout() {freopen("out.txt","w",stdout);}
inline int read() { int x=0,f=1;char ch=getchar();while(ch>'9'||ch<'0') { if(ch=='-') f=-1; ch=getchar();}while(ch>='0'&&ch<='9') {x=x*10+ch-'0';ch=getchar();}return x*f;}
const int rev = (MOD+1)>>1;
int a[N],tem[N];
int n,m;
vector<int> g[N];
int dp[N][N];
int ans[N];
void FWT(int *a,int n)  {  
    for(int d=1; d1)  
        for(int m=d<<1,i=0; im)  
            for(int j=0; j)  {  
                int x=a[i+j],y=a[i+j+d];  
                a[i+j]=(x+y)%MOD,a[i+j+d]=(x-y+MOD)%MOD;   
            }  
}  
  
void UFWT(int *a,int n)  {  
    for(int d=1; d1)  
        for(int m=d<<1,i=0; im)  
            for(int j=0; j) {  
                int x=a[i+j],y=a[i+j+d];  
                a[i+j]=1LL*(x+y)*rev%MOD,a[i+j+d]=(1LL*(x-y)*rev%MOD+MOD)%MOD;   
            }  
}  
  
void solve(int *a,int *b,int n)  {  
    FWT(a,n);  
    FWT(b,n);  
    for(int i=0; iMOD;  
    UFWT(a,n);  
}  

void dfs(int u,int f){
    dp[u][a[u]]=1;
    for(int i=0;i<(int)g[u].size();i++){
        int v=g[u][i];
        if(v==f) continue;
        dfs(v,u);
        for(int j=0;jdp[u][j];
        solve(dp[u],dp[v],m);
        for(int j=0;jMOD;
    }
    for(int i=0;iMOD;
}
int main(){
    // fre();
    int T;
    scanf("%d",&T);
    while(T--){
        clc(dp,0);
        clc(ans,0);
        scanf("%d%d",&n,&m);
        for(int i=1;i<=n;i++) {
            scanf("%d",&a[i]);
            g[i].clear();
        }
        for(int i=1;i<=n-1;i++){
            int u,v;
            scanf("%d%d",&u,&v);
            g[u].push_back(v);
            g[v].push_back(u);
        }
        dfs(1,0);
        for(int i=0;i){
            printf("%d%c",ans[i],i==m-1 ? '
':' ');
        }
    }
    return 0;
}