#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e5 + 10;
#define fi first
#define se second
typedef pair<int,int> pii;
typedef pair<int,pair<int,int>> piii;
int n,m; 
int d[N];
int c[N];
priority_queue<piii,vector<piii>,greater<piii>> heap;
priority_queue<pii,vector<pii>,greater<pii>> q[N];
int main()
{
	scanf("%d %d",&n,&m);
	for(int i= 1;i<=m;i++)
	{
		int a,b,c;
		scanf("%d %d %d",&a,&b,&c);
		heap.push({c,{a,i}});
		q[a].push({b,i});
	}
	int k;
	int l = 0;
	int r = 0;
	int res = 0;
	vector<pii> v;
	for(int i = 1;i<n;i++)
	{
		res += q[i].top().fi;
	}
	v.push_back({heap.top().fi,res});
	while(heap.size())
	{
		r = heap.top().fi;
		while(heap.size() && heap.top().fi == r)
		{
			auto t = heap.top();
			int i = t.se.fi;
			int idx = t.se.se;	
			while(q[i].size() && q[i].top().se == idx)
			{
				res -= q[i].top().fi;
				q[i].pop();
				res += q[i].top().fi;
			}
			heap.pop();
		}
		if(heap.empty())
		{
			break;
		}
		auto t = heap.top();
		r = t.fi;
		v.push_back({r,res});
	}
	scanf("%d",&k);
	
	while(k--)
	{
		int x;
		scanf("%d",&x);
		pii s = {x,0};
		auto idx = lower_bound(v.begin(),v.end(),s) - v.begin();
		if(idx >= v.size())
		{
			puts("impossible");
		}
		else
		{
			printf("%d\n",v[idx].se);
		}
	}
//	for(auto x : v)
//	{
//		cout<<x.fi<<' '<<x.se<<endl;
//	}
	return 0;
}