#include <bits/stdc++.h>
#define ll long long
#define ll1 long long
#define ull unsigned long long
#define dou long double
#define str string
#define vll vector<ll>
#define vi vector<int>
#define pll pair<ll, ll>
#define vpll vector<pll>
#define vbool vector<bool>
#define vstr vector<str>
#define vvll vector<vll>
#define pb push_back
#define pf push_front
//#define endl "\n"
#define fr first
#define se second
// #define sortcmp(a) sort(a.begin(), a.end(), cmp)
#define sort(a) sort(a.begin(), a.end())
#define reverse(a) reverse(a.begin(), a.end())
#define speed ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define INF 1000000000000000000
#define ordered_set tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update>
using namespace std;
//using namespace __gnu_pbds;
mt19937 rng(time(0));
ll randll(ll l, ll r){
return uniform_int_distribution<ll>(l, r)(rng);
}
vector<vpll> g;
ll f(multiset<ll>& s, vll p){
vll b;
for(int j : s){
b.pb(j);
}
reverse(b);
ll res = 0;
for(int j : b){
ll maxl = -INF, x = -1;
for(int i1 = 0; i1 < 5; i1 ++){
if(p[i1] == -1) continue;
if(j/10*(i1+1)-p[i1] > maxl){
maxl = j/10*(i1+1)-p[i1];
x = i1;
}
}
if(maxl > 0){
res += maxl;
p[x] = -1;
}
}
return res;
}
int main(){
speed;
ll n, m, k;
cin >> n >> m >> k;
g.resize(n+7);
vll a(k);
for(int i =0 ; i < k; i ++){
cin >> a[i];
}
for(int i = 0; i < m; i ++){
ll a, b, c;
cin >> a >> b >> c;
g[a].pb({b, c});
}
ll q;
cin >> q;
while(q --){
ll x;
vll p(5);
cin >> x;
for(int i =0 ; i < 5; i ++){
cin >> p[i];
}
vll p1 = p;
vll d(n, INF);
vector<multiset<ll>> v(n);
d[x] = 0;
set<pll> s;
for(int i = 0; i < n; i ++){
s.insert({d[i], i});
}
while(s.size()){
pll p = *s.begin();
s.erase(s.begin());
for(auto i : g[p.se]){
ll k = p.fr+f(v[p.se], p1) + i.se;
multiset<ll> s1 = v[p.se];
s1.insert(i.se);
if(s1.size() == 6) s1.erase(s1.begin());
k -= f(s1, p1);
if(d[i.fr] > k){
s.erase({d[i.fr], i.fr});
d[i.fr] = k;
s.insert({d[i.fr], i.fr});
v[i.fr] = s1;
}
}
}
ll minl = INF;
for(int i : a){
minl = min(minl, d[i]);
}
if(minl != INF) cout << minl << endl;
else cout << -1 << endl;
}
}
