#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int t; cin >> t;
  while (t--) {
    int n, k; cin >> n >> k;
    vector<vector<int>> graph(n);
    REP(_, n - 1) {
      int x, y; cin >> x >> y; --x; --y;
      graph[x].emplace_back(y);
      graph[y].emplace_back(x);
    }
    vector<int> a(n);
    for (int& a_i : a) cin >> a_i;
    int x = 0;
    const auto dfs = [&](auto dfs, const int par, const int ver, const int dep) -> void {
      if (dep == 1) x ^= a[ver] % (k + 1);
      for (const int e : graph[ver]) {
        if (e != par) dfs(dfs, ver, e, dep ^ 1);
      }
    };
    dfs(dfs, -1, 0, 0);
    cout << (x == 0 ? "P\n" : "K\n");
  }
  return 0;
}