#include <bits/stdc++.h>
using namespace std;

using i64 = long long;

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    
    auto solve = [&]() {
        int n, m;
        cin >> n >> m;

        vector<array<int, 3>> e(m);
        for (auto &[c, d, u] : e) {
            cin >> u >> d >> c;
            u--;
        }

        sort(e.begin(), e.end());

        int q;
        cin >> q;

        vector<array<int, 2>> qs(q);
        for (int i = 0; i < q; i++) {
            cin >> qs[i][0];
            qs[i][1] = i;
        }

        sort(e.rbegin(), e.rend());
        sort(qs.rbegin(), qs.rend());

        constexpr int INF = 2e4;
        vector<int> mn(n - 1, INF);
        int cnt = n - 1;
        int sum = (n - 1) * INF;

        vector<int> ans(q, sum);

        for (int j = 0; auto [v, i] : qs) {
            while (j < m && e[j][0] >= v) {
                auto [c, d, u] = e[j];
                if (d < mn[u]) {
                    if (mn[u] == INF) {
                        cnt--;
                    }
                    sum -= mn[u] - d;
                    mn[u] = d;
                }
                j++;
            }
            if (cnt == 0) {
                ans[i] = sum;
            }
        }

        for (int i = 0; i < q; i++) {
            if (ans[i] == INF) {
                cout << "impossible\n";
            } else {
                cout << ans[i] << '\n';
            }
        }
    };

    solve();

    return 0;
}