from sys import stdin
input = stdin.readline
from collections import deque

for _ in range(int(input())):
    N, K = map(int, input().split())
    G = [[] for _ in range(N)]
    for _ in range(N-1):
        u, v = map(int, input().split())
        u, v = u-1, v-1
        G[u].append(v)
        G[v].append(u)
    A = list(map(int, input().split()))

    dist = [-1]*N
    dist[0] = 0
    que = deque()
    que.append(0)
    while que:
        n = que.popleft()
        for v in G[n]:
            if dist[v] == -1:
                dist[v] = dist[n]+1
                que.append(v)
    
    xor = 0
    for i in range(N):
        if dist[i]%2 == 1:
            xor ^= A[i]%(K+1)
    
    print("K" if xor != 0 else "P")