tjut 2851

#include <cstdio>
#include <cstring>
#include <vector>
#include <queue>
using namespace std;
const int maxn = 2010;
const int INF = 1<<30;
int n,m;
struct node
{
    int x,y,cost;
}f[maxn];

struct edge
{
    int to,cost;
    edge(){}
    edge(int x,int y) {
        to=x;
        cost=y;
    }
};
typedef pair<int,int>P;
vector<edge>G[maxn];
int d[maxn];
void dijkstra(int s)
{
    priority_queue<P,vector<P>,greater<P> >que;
    for(int i=1;i<=maxn;i++) d[i]=INF;
    d[s]=f[1].cost;
    que.push(P(f[1].cost,s));

    while(!que.empty())
    {
        P p=que.top();que.pop();
        int v=p.second;
        if(d[v]<p.first) continue;
        for(int i=0;i<G[v].size();i++)
        {
            edge e=G[v][i];
            if(d[e.to]>d[v]+e.cost)
            {
                d[e.to]=d[v]+e.cost;
                que.push(P(d[e.to],e.to));
            }
        }
    }
}

int main()
{
    //freopen("a.txt","r",stdin);
    int t,k;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&m);
        for(int i=1;i<=n;i++)
        {
            G[i].clear();
            scanf("%d%d%d",&f[i].x,&f[i].y,&f[i].cost);
        }
        //printf("%d\n",n);
        for(int i=1;i<=n;i++)
        {
            for(int j=i+1;j<=n;j++)
                if(f[j].x<=f[i].y)
                {
                    G[i].push_back(edge(j,f[j].cost));
                   // printf("%d %d %d\n",i,j,p[i].cost+p[j].cost);
                }
        }
        dijkstra(1);
        for(int i=0;i<m;i++)
        {
            scanf("%d",&k);
            if(d[k]==INF) printf("-1\n");
            else
            printf("%d\n",d[k]);
        }
    }
    return 0;
}