#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=998244353,MAX=300005,INF=15<<26;

vector<int> G[MAX];
int dis[MAX];

int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    int Q;cin>>Q;
    while(Q--){
        ll N,K;cin>>N>>K;
        for(int i=0;i<N;i++){
            G[i].clear();
            dis[i]=INF;
        }
        for(int i=0;i<N-1;i++){
            int a,b;cin>>a>>b;a--;b--;
            G[a].push_back(b);
            G[b].push_back(a);
        }
        queue<int> Q;
        Q.push(0);
        dis[0]=0;
        while(!Q.empty()){
            int u=Q.front();Q.pop();
            for(int to:G[u]) if(chmin(dis[to],dis[u]+1)) Q.push(to);
        }
        
        ll X=0;
        for(int i=0;i<N;i++){
            ll x;cin>>x;
            x%=(K+1);
            if(dis[i]&1) X^=x;
        }
        if(X) cout<<"K\n";
        else cout<<"P\n";
    }
}