/*
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,fma,bmi,bmi2,sse4.2,popcnt,lzcnt")
*/
#include <bits/stdc++.h>
#define taskname ""
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define i64 long long
#define int long long
#define isz(x) (int)x.size()
using namespace std;
void solve() {
int n, m, k;
cin >> n >> m >> k;
vector<int> st(k);
for (int i = 0; i < k; ++i) {
cin >> st[i];
}
vector<vector<pair<int, int>>> g(n);
for (int i = 0; i < m; ++i) {
int u, v, c;
cin >> u >> v >> c;
g[v].emplace_back(u, c);
}
const int inf = 1e18;
vector<vector<int>> dist(n, vector<int>(1 << 5, inf));
priority_queue<pair<int, pair<int, int>>, vector<pair<int, pair<int, int>>>, greater<pair<int, pair<int, int>>>> pq;
for (auto u : st) {
dist[u][0] = 0;
pq.push({0, {u, 0}});
}
while (not pq.empty()) {
auto [d, p] = pq.top();
pq.pop();
auto [u, mask] = p;
if (dist[u][mask] != d) continue;
for (auto [v, w] : g[u]) {
for (int ticket = 0; ticket < 5; ++ticket) if (~mask >> ticket & 1) {
int nd = d + (w / 10 * (9 - ticket));
if (dist[v][mask ^ (1 << ticket)] > nd) {
dist[v][mask ^ (1 << ticket)] = nd;
pq.push({nd, {v, mask ^ (1 << ticket)}});
}
}
if (dist[v][mask] > d + w) {
dist[v][mask] = d + w;
pq.push({d + w, {v, mask}});
}
}
}
int q;
cin >> q;
while (q--) {
int S;
array<int, 5> P;
cin >> S;
for (int i = 0; i < 5; ++i) {
cin >> P[i];
if (P[i] == -1) {
P[i] = inf;
}
}
int res = LLONG_MAX;
for (int mask = 0; mask < 1 << 5; ++mask) {
int cur = dist[S][mask];
for (int i = 0; i < 5; ++i) if (mask >> i & 1) {
cur += P[i];
}
res = min(res, cur);
}
cout << (res == inf ? -1 : res) << "\n";
}
}
signed main() {
#ifndef CDuongg
if (fopen(taskname".inp", "r"))
assert(freopen(taskname".inp", "r", stdin)), assert(freopen(taskname".out", "w", stdout));
#else
freopen("bai3.inp", "r", stdin);
freopen("bai3.out", "w", stdout);
auto start = chrono::high_resolution_clock::now();
#endif
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int t = 1; //cin >> t;
while(t--) solve();
#ifdef CDuongg
auto end = chrono::high_resolution_clock::now();
cout << "\n"; for(int i = 1; i <= 100; ++i) cout << '=';
cout << "\nExecution time: " << chrono::duration_cast<chrono::milliseconds> (end - start).count() << "[ms]" << endl;
#endif
}
