#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <stack>
#include <algorithm>

using namespace std;
typedef long long LL;
typedef pair<LL,int> pii;
const int N = 500011 ;
const int inf = 1e9+7;

#define X first
#define Y second
#define root 1,n,1
#define lr rt<<1
#define rr rt<<1|1
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1

int n,m;

struct node{
    int id,b,c;
    bool operator<(const node &a)const{
        if( c != a.c )return c>a.c;
        else return id < a.id ;
    }
}e[N];

int pos1[N] , pos2[N] , dfs_clock , ans[N] , F[N];

vector<int>g[N];

void Init() {
    for( int i = 0 ; i < N ; ++i ) g[i].clear();
}
void dfs( int u ) {
    pos1[u] = pos2[u] = ++dfs_clock;
    for( int i = 0 ; i < g[u].size() ; ++i ) {
        int v = g[u][i];
        dfs(v); pos2[u] = pos2[v];
    }
}

int date[N<<2] ;

void Up( int rt ) {
    if( date[rr] == -1 || ( F[ date[lr] ] >= F[ date[rr] ] ) ) date[rt] = date[lr] ;
    else date[rt] = date[rr];
}

void Build( int l , int r , int rt ) {
    date[rt] = -1 ;
    if( l == r ) return ;
    int mid = (l+r)>>1;
    Build(lson) , Build(rson) ;
}

void Update( int l , int r , int rt , int x ,int id ) {
    if( l == r ) {
        date[rt] = id ; return ;
    }
    int mid = (l+r)>>1;
    if( x <= mid ) Update(lson,x,id);
    else Update(rson,x,id);
    Up(rt);
}

int Query( int l , int r , int rt , int L , int R ) {
    if( l == L && r == R ) {
        return date[rt];
    }
    int mid = (l+r)>>1;
    if( R <= mid ) return Query(lson,L,R);
    else if( L > mid ) return Query(rson,L,R);
    else {
        int id1 = Query(lson,L,mid) , id2 = Query( rson,mid+1,R ) ;
        if( id2 == -1 || ( F[id1] >= F[id2] ) ) return id1 ;
        else return id2 ;
    }
}

void Solve() {
    dfs_clock = 0 ; dfs(0);
    Build(root);
    sort( e , e + n ) ;
    for( int i = 0 ; i < n ; ++i ) {
        int id = e[i].id ;
        ans[id] = Query(root,pos1[id],pos2[id]);
        Update(root,pos1[id],id );
    }
}

void Read() {
    scanf("%d%d",&n,&m);
    e[0].id = 0 , e[0].c = e[0].b = inf , F[0] = inf ;
    for( int i = 1 ; i < n ; ++i ) {
        int fa ;scanf("%d%d%d",&fa,&e[i].b,&e[i].c);
        e[i].id = i ; F[i] = e[i].b ;
        g[fa].push_back(i);
    }
}

void Output() {
    while( m-- ) {
        int x ;scanf("%d",&x);
        printf("%d\n",ans[x]);
    }
}
int main(){
    #ifdef LOCAL
        freopen("in.txt","r",stdin);
    #endif // LOCAL
    ios::sync_with_stdio(false);
    int _ ; scanf("%d",&_);
    while(_--) Init() , Read() , Solve() , Output() ;
}