#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;

using isize = size_t;
using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
using i128 = __int128_t;
using u128 = __uint128_t;
using f64 = long double;
using p2 = pair<i64, i64>;
using el = tuple<i64, i64, i64>;
using mint = atcoder::modint998244353;

void _main();
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(18);
  _main();
}

i64 pow(i64 x, i64 n) {
  i64 res = 1;
  i64 t = x;
  while (n > 0) {
    if (n & 1) {
      res = res * t;
    }
    t = t * t;
    n >>= 1;
  }
  return res;
}
i64 pow(i64 x, i64 n, i64 m) {
  i64 res = 1;
  i64 t = x % m;
  while (n > 0) {
    if (n & 1) {
      res = res * t % m;
    }
    t = t * t % m;
    n >>= 1;
  }
  return res;
}

void _main() {
  i64 ttt;
  cin >> ttt;
  for (;ttt--;) {
    i64 n, K;
    cin >> n >> K;
    vector<vector<i64>> g(n);
    for (i64 i = 0; i < n - 1; i++) {
      i64 x, y;
      cin >> x >> y;
      x--, y--;
      g[x].push_back(y);
      g[y].push_back(x);
    }
    vector<i64> dep(n, 0);
    auto dfs = [&](auto& self, i64 v, i64 par) -> void {
      for (i64 nv : g[v]) {
        if (nv == par) continue;
        dep[nv] = dep[v] + 1;
        self(self, nv, v);
      }
    };
    dfs(dfs, 0, -1);
    i64 sum = 0;
    for (i64 i = 0; i < n; i++) {
      i64 x;
      cin >> x;
      if (dep[i] % 2 == 1) sum ^= x % (K + 1);
    }
    cout << (sum == 0 ? "P\n" : "K\n");
  }
}