from collections import deque
def BFS(vi, e_list):
    N = len(e_list)
    INF = 10**9

    Q = deque([vi])

    min_path_list = [INF]*N #change
    min_path_list[vi] = 0

    while len(Q)>0:
        v = Q.pop()
        for v1 in e_list[v]:
            if min_path_list[v1] >= INF:
                Q.appendleft(v1)
                min_path_list[v1] = min_path_list[v]+1 #change
    return min_path_list

def solve():
    N,K = list(map(int,input().split()))
    e_list = [[] for i in range(N)]
    for i in range(N-1):
        x,y = list(map(int,input().split()))
        x -= 1
        y -= 1
        e_list[x].append(y)
        e_list[y].append(x)
    A = list(map(int,input().split()))
    min_path_list = BFS(0, e_list)
    B = []
    x = 0
    for a, d in zip(A, min_path_list):
        if d%2==1:
            x ^= (a%(K+1))
    if x==0:
        print("P")
    else:
        print("K")

T = int(input())

for i in range(T):
    solve()