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


def solve(n, k, edges, a):
    graph = [[] for _ in [0] * n]
    for x, y in edges:
        graph[x].append(y)
        graph[y].append(x)
    depth_parity = [-1] * n
    depth_parity[0] = 0
    que = deque([0])
    while(que):
        v_now = que.popleft()
        p_next = depth_parity[v_now] ^ 1
        for v_next in graph[v_now]:
            if(depth_parity[v_next] != -1):
                continue
            depth_parity[v_next] = p_next
            que.append(v_next)
    grundy = 0
    for i, x in enumerate(a):
        if not(depth_parity[i]):
            continue
        grundy ^= (x % (k + 1))
    return 'K' if(grundy != 0) else 'P'


t = int(input())
for _ in [0] * t:
    n, k = map(int, input().split())
    edges = [[x - 1 for x in map(int, input().split())] for _ in [0] * (n - 1)]
    a = list(map(int, input().split()))
    print(solve(n, k, edges, a))