#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
const int N = 1e5 + 5;
struct edge {
    int u, d, c;
};
bool cmp(edge x, edge y) {
	return x.c > y.c;
}
struct query {
    int w, ind, st, en, ans;
};
int n, m, q, C[N];
vector<edge> edges;
queue<int> mids[N];
int main() {
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n >> m;
    for(int i = 0;i < m;i++) {
		int x, d, c;
		cin >> x >> d >> c;
		edges.push_back({x, d, c});
	}
	sort(edges.begin(), edges.end(), cmp);
	cin >> q;
	vector<query> queries(q);
	for(int i = 0;i < q;i++) {
		int w;
		cin >> w;
		queries[i] = {w, i, 0, m - 1, -1};
	}
	while(1) {
		bool found = false;
		for(int i = 1;i <= n;i++)
			C[i] = 2e4;
		for(int i = 0;i < q;i++) {
			if(queries[i].st > queries[i].en)
				continue;
			int mid = queries[i].st + queries[i].en >> 1;
			mids[mid].push(i);
			found = true;
		}
		if(!found)
			break;
		int ans = (n - 1) * 2e4, cnt = 0;
		for(int i = 0;i < m;i++) {
			int u = edges[i].u;
			int d = edges[i].d;
			if(C[u] > d) {
				if(C[u] == 2e4)
					cnt++;
				ans -= C[u];
				C[u] = d;
				ans += C[u];
			}
			while(mids[i].size()) {
				int cur = mids[i].front();
				mids[i].pop();
				if(queries[cur].w > edges[i].c)
					queries[cur].en = i - 1;
				else if(cnt == n - 1)
					queries[cur].ans = ans, queries[cur].st = i + 1;
				else
					queries[cur].en = i - 1;
			}
		}
	}	
	for(int i = 0;i < q;i++) {
		if(queries[i].ans == -1)
			cout << "impossible\n";
		else
			cout << queries[i].ans << '\n';
	}
    return 0;
}