#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 50;
void chmin(ll& a, ll b) { if(a > b) a = b; }

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    ll N, E, K;
    cin >> N >> E >> K;
    vector<bool> T(N);
    while(K--) {
        int t;
        cin >> t;
        T[t] = 1;
    }
    vector rev(N, vector<pair<ll, ll>>{});
    while(E--) {
        ll A, B, C;
        cin >> A >> B >> C;
        rev[B].emplace_back(A, C);
    }
    vector dp(N, vector(1 << 5, INF));
    priority_queue q(greater<>{}, vector<tuple<ll, ll, ll>>{});
    auto push = [&](ll at, ll bit, ll cost) {
        if(dp[at][bit] <= cost) return;
        dp[at][bit] = cost;
        q.emplace(cost, at, bit);
    };
    for(ll i = 0; i < N; i++) if(T[i]) push(i, 0, 0);
    while(q.size()) {
        auto [cost, at, bit] = q.top();
        q.pop();
        if(dp[at][bit] != cost) continue;
        for(auto [to, d] : rev[at]) {
            push(to, bit, cost + d);
            for(ll i = 0; i < 5; i++) if(~bit & 1 << i) push(to, bit | 1 << i, cost + d * (9 - i) / 10);
        }
    }
    ll Q;
    cin >> Q;
    while(Q--) {
        ll S;
        vector<ll> P(5);
        cin >> S;
        for(ll& p : P) {
            cin >> p;
            if(p == -1) p = INF;
        }
        ll ans = INF;
        for(ll bit = 0; bit < 1 << 5; bit++) {
            ll cost = dp[S][bit];
            for(ll i = 0; i < 5; i++) if(bit & 1 << i) cost += P[i];
            chmin(ans, cost);
        }
        if(ans == INF) ans = -1;
        cout << ans << '\n';
    }
}