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

struct cp
{
    bool operator()(pair<int,int> a,pair<int,int> b){
        return a.second > b.second; // Changed to '>' for min-heap behavior
    }
};

void solve(){
    int n,m,k; cin >> n >> m >> k;
    vector<int> go(k);
    for(int i=0; i < k;i++) cin >> go[i];
    vector<vector<pair<int,int>>> arr(n+1);
    for(int i=0; i < m;i++){
        int l,r,c; cin >> l >> r >> c;
        arr[l].push_back({r,c});
        arr[r].push_back({l,c});
    }
    priority_queue<pair<int,int>, vector<pair<int,int>>, cp> pq; // Changed to min-heap
    int q; cin >> q;
    while(q--){
        int s; cin >> s;
        int temp; cin >> temp >> temp >> temp >> temp >> temp;
        ll ans=0;
        if(s==go[0]){
            cout << 0 << endl;
            continue;
        }
        vector<bool> found(n+1);
        for(auto c: arr[s]){
            pq.push({c.first, c.second});
            found[s]=true;
        }
        
        found[s]=true;
        while(!pq.empty()){
            pair<int,int> c=pq.top();
            pq.pop();
            if(found[c.first]) continue;
            found[c.first]=true;
            if(c.first==go[0]){
                cout << c.second << endl;
                break;
            }
            for(auto g: arr[c.first]){
                if(found[g.first]) continue;
                pq.push({g.first, g.second+c.second});
            }
        }
        if(!found[go[0]]) cout << -1 << endl;
    }
}

int main() {
    ios::sync_with_stdio(false);cout.tie(0);cin.tie(0);
    int t=1;
    // cin >> t;
    while(t--){
        solve();
    } 
}