#include <bits/stdc++.h>
using ll = long long;
using namespace std;
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
ll n, e, k;
cin >> n >> e >> k;
vector<ll> a(k);
vector<ll> p(5);
for (auto &i : a) {
cin >> i;
}
vector<vector<pair<ll, ll>>> adj(n + 1);
for (int i = 0; i < e; i++) {
ll u, v, c;
cin >> u >> v >> c;
adj[u].push_back({v, c});
}
auto find = [&](ll u) -> ll {
vector<vector<ll>> dist(n + 1, vector<ll>(1 << 5, 1e18));
dist[u][0] = 0;
priority_queue<pair<ll, pair<ll, ll>>> pq;
pq.push({0, {u, 0}});
while (!pq.empty()) {
auto [nd, buff] = pq.top();
auto [u, dis] = buff;
pq.pop();
nd = -nd;
if (nd > dist[u][dis])
continue;
for (auto [v, c] : adj[u]) {
if (dist[v][dis] > dist[u][dis] + c) {
dist[v][dis] = dist[u][dis] + c;
pq.push({-dist[v][dis], {v, dis}});
}
ll newdis = dis;
for (int i = 0; i < 5; i++) {
if (p[i] == -1)
continue;
if (dis & (1 << i))
continue;
newdis = dis | (1 << i);
ll newc = ((c * (10 - i - 1)) / 10);
if (dist[v][newdis] > dist[u][dis] + newc) {
dist[v][newdis] = dist[u][dis] + newc;
pq.push({-dist[v][newdis], {v, newdis}});
};
}
}
}
ll ans = 1e18;
for (int i = 0; i < k; i++) {
for (int j = 0; j < (1 << 5); j++) {
ll add = 0;
for (int k = 0; k < 5; k++) {
if (j & (1 << k))
add += p[k];
}
ans = min(ans, dist[a[i]][j] + add);
}
}
if (ans == 1e18)
return -1;
return ans;
};
ll q;
cin >> q;
for (int i = 0; i < q; i++) {
ll s;
cin >> s;
for (int j = 0; j < 5; j++) {
cin >> p[j];
}
cout << find(s) << "\n";
}
}
