#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <assert.h>
#define IOS ios::sync_with_stdio(false)
using namespace std;
#define inf (0x3f3f3f3f)
typedef long long int LL;


#include <iostream>
#include <sstream>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <string>
const int maxn = 50000 + 20;
struct Edge {
    int u, v, w;
    int tonext;
}e[2 * maxn];
int num;
int first[maxn + 20];
int getid[1000000 + 20];
struct node {
    int loy, abi;
    bool operator < (const struct node & rhs) const {
        return abi < rhs.abi;
    }
}a[maxn], List[maxn], tosort[maxn];
void addEgde(int u, int v) {
    ++num;
    e[num].u = u;
    e[num].v = v;
    e[num].tonext = first[u];
    first[u] = num;
}
int DFN;
int L[maxn], R[maxn];
bool vis[maxn];
void dfs(int cur) {
    L[cur] = DFN;
    for (int i = first[cur]; i; i = e[i].tonext) {
        int v = e[i].v;
//        assert(vis[v] == false);
//        vis[v] = true;
        ++DFN;
        List[DFN] = tosort[DFN] = a[v];
        dfs(v);
    }
    R[cur] = DFN;
}
int magic;
int mx[maxn];
int tofind(int begin, int end, int val) {
//    cout << begin << " " << end << " ***" << endl;
    if (tosort[end].abi <= val) return -1;
    if (tosort[begin].abi > val) return mx[begin];
    while (begin <= end) {
        int mid = (begin + end) >> 1;
        if (tosort[mid].abi > val) {
            end = mid - 1;
        } else begin = mid + 1;
    }
    return mx[begin];
}
void work() {
    int n, m;
    cin >> n >> m;
    magic = (int)sqrt(n * 1.0);
    for (int i = 1; i <= n - 1; ++i) {
        int fa;
        cin >> fa >> a[i].loy >> a[i].abi;
        getid[a[i].loy] = i;
        addEgde(fa, i);
    }
    dfs(0);
//    for (int i = 0; i <= n - 1; ++i) {
//        cout << L[i] << " " << R[i] << endl;
//    }
    for (int i = 0; i < n; i += magic) {
        int j = i + magic;
        if (j > n) break;
        sort(tosort + i, tosort + j);
        mx[j - 1] = tosort[j - 1].loy;
        for (int k = j - 2; k >= i; --k) {
            if (tosort[k].loy < mx[k + 1]) {
                mx[k] = mx[k + 1];
            } else mx[k] = tosort[k].loy;
        }
//        for (int k = i; k < i + magic; ++k) {
//            cout << mx[k] << endl;
//        }
    }
    while (m--) {
        int id;
        cin >> id;
        int val = a[id].abi;
        int begin = L[id], end = R[id];
//        cout << begin << " " << end << " ***" << endl;
        int ans = -1;
        for (int i = begin + 1; i <= end;) {
            if (i % magic == 0 && i + magic <= end) {
                ans = max(ans, tofind(i, i + magic - 1, val));
                i += magic;
            } else {
                if (List[i].abi > val && ans < List[i].loy) {
                    ans = List[i].loy;
                }
                ++i;
            }
        }
        if (ans == -1) {
            cout << -1 << endl;
        } else cout << getid[ans] << endl;
    }
}

int main() {
#ifdef local
    freopen("data.txt", "r", stdin);
//    freopen("data.txt", "w", stdout);
#endif
    IOS;
    a[0].abi = a[0].loy = -1;
    List[0] = tosort[0] = a[0];
    int t;
    cin >> t;
    while (t--) {
        DFN = 0;
        num = 0;
        memset(mx, -1, sizeof mx);
        memset(first, 0, sizeof first);
        work();
    }
    return 0;
}