import sys
input = sys.stdin.readline

def non_rec_dfs(s, G):
    N = len(G)
    stack = [s]
    par = [-1] * N
    sz = [1] * N
    d = [0] * N
    while stack:
        u = stack.pop()
        if u >= 0:
            stack.append(~u)
            for v in G[u]:
                if v == par[u]:
                    continue
                par[v] = u
                d[v] = d[u] + 1
                stack.append(v)


    return d


T = int(input())
for _ in range(T):
    N, K = map(int, input().split())
    G = [[] for i in range(N)]
    for i in range(N - 1):
        u, v = map(int, input().split())
        u, v = u - 1, v - 1
        G[u].append(v)
        G[v].append(u)
        
    d = non_rec_dfs(0, G)
    A = list(map(int, input().split()))
    ans = 0
    for i in range(N):
        if d[i] % 2:
            ans ^= A[i] % (K + 1)
    print("K") if ans else print("P")