hdu 4625 JZPTREE (组合数学)

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <ctime>
#include <cstdlib>
#include <functional>
using namespace std;


#define eps 1e-10
#define N 50020
#define B 100020
#define M 200020
#define mod 10007
#define inf 0x3f3f3f3f
#define LL long long
#define pii pair<int, int>
#define MP make_pair
#define fi first
#define se second
#define ls (i << 1)
#define rs (ls | 1)
#define md (ll + rr >> 1)
#define lson ll, md, ls
#define rson md + 1, rr, rs
#define ui unsigned int
char buf[32000000],*pt = buf,*o = buf;
int getint(){
    int f = 1,x = 0;
    while((*pt != '-') && (*pt < '0' || *pt > '9'))    pt ++;
    if(*pt == '-')    f = -1,pt ++;    else    x = *pt++ - 48;
    while(*pt >= '0' && *pt <= '9')    x = x * 10 + *pt ++ - 48;
    return x * f;
}
char getch(){
    char ch;
    while(*pt < 'A' || *pt > 'Z')    pt ++;
    ch=*pt;pt++;
    return ch;
}
int F[N];
int S[520][520];
int f[N][520];
int n, k;
int fst[N], nxt[M], vv[M], e;
int tmp[520];

void einit() {
	memset(fst, -1, sizeof fst);
	e = 0;
}
void add(int u, int v) {
	vv[e] = v, nxt[e] = fst[u], fst[u] = e++;
}
void init() {
	F[0] = 1;
	for(int i = 1; i < N; ++i) {
		F[i] = F[i-1] * i % mod;
	}
	S[0][0] = 1;
	for(int i = 1; i < 520; ++i) {
		for(int j = 1; j < 520; ++j) {
			S[i][j] = (j * S[i-1][j] + S[i-1][j-1]) % mod;
		}
	}
}

void dfs1(int u, int p) {
	memset(f[u], 0, sizeof f[u]);
	for(int i = fst[u]; ~i; i = nxt[i]) {
		int v = vv[i];
		if(v == p) continue;
		dfs1(v, u);
		for(int j = 1; j <= k; ++j) {
			f[u][j] = (f[u][j] + f[v][j] + f[v][j-1]) % mod;
		}
		f[u][0] = (f[u][0] + f[v][0]) % mod;
	}
	f[u][0] = (f[u][0] + 1) % mod;
}

void dfs2(int u, int p) {
	if(u != 1) {
		memset(tmp, 0, sizeof tmp);
		for(int i = 0; i <= k; ++i) {
			tmp[i] = f[p][i];
			tmp[i] -= f[u][i];
			if(i > 0) tmp[i] -= f[u][i-1];
			tmp[i] %= mod; if(tmp[i] < 0) tmp[i] += mod;
		}
		for(int i = 1; i <= k; ++i) {
			f[u][i] = (f[u][i] + tmp[i] + tmp[i-1]) % mod;
		}
		f[u][0] = (f[u][0] + tmp[0]) % mod;
	}
	for(int i = fst[u]; ~i; i = nxt[i]) {
		int v = vv[i];
		if(v != p) dfs2(v, u);
	}
}

int main() {
	init();
	int cas;
	scanf("%d", &cas);
	while(cas--) {
		scanf("%d%d", &n, &k);
		einit();
		for(int i = 1; i < n; ++i) {
			int u, v;
			scanf("%d%d", &u, &v);
			add(u, v);
			add(v, u);
		}
		dfs1(1, 0);
		dfs2(1, 0);
		for(int i = 1; i <= n; ++i) {
			int ans = 0;
			for(int j = 1; j <= k; ++j) {
				ans = (ans + S[k][j] * F[j] % mod * f[i][j] % mod) % mod;
			}
			printf("%d\n", ans);
		}
	}
	return 0;
}