/*
Code written by Talant I.D.
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
#define precision(n) fixed << setprecision(n)
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define mp make_pair
#define eps (double)1e-9
#define PI 2*acos(0.0)
#define endl "\n"
#define sz(v) int((v).size())
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define do_not_disturb ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define OK cout << "OK" << endl;
inline bool isvowel(char ch){
ch = tolower(ch);
return (ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u');
}
inline bool isprime(int n){
if(n < 2 || (n%2 == 0 && n != 2)) return false;
for(int i = 3; i*i <= n; i++)
if(n%i == 0) return false;
return true;
}
class Union{
private:
vector <int> saizu, link;
public:
Union(int n){
saizu.assign(n, 1); link.resize(n);
iota(all(link), 0);
}
int find(int n){
if(link[n] == n) return n;
return link[n] = find(link[n]);
}
int same(int a, int b){
return find(a) == find(b);
}
void unite(int a, int b){
if(same(a, b)) return;
a = find(a); b = find(b);
if(saizu[a] < saizu[b]) swap(a, b);
saizu[a] += saizu[b];
link[b] = a;
}
int getsize(int a){
return saizu[find(a)];
}
};
const int mod = 1e9+7;
ll mode(ll a){
a %= mod;
if(a < 0) a += mod;
return a;
}
ll subt(ll a, ll b){
return mode(mode(a)-mode(b));
}
ll add(ll a, ll b){
return mode(mode(a)+mode(b));
}
ll mult(ll a, ll b){
return mode(mode(a)*mode(b));
}
ll binpow(ll a, ll b){
ll res = 1;
while(b){
if(b&1) res = mult(res, a);
a = mult(a, a);
b >>= 1;
}
return res;
}
/*
struct Node{
ll val, l, r, sum;
Node operator + (Node other){
return {max(max(val, other.val), r+other.l), max(l, sum+other.l), max(other.r, other.sum+r), sum+other.sum};
}
};
class Segment_tree{
private:
vector <Node> tree;
//vector <int> lz;
public:
Segment_tree(int n){
tree.resize(n*4);
//lz.resize(n*4);
}
void build(int v, int l, int r){
if(l == r){
tree[v] = {max(0ll, vec[l]), max(0ll, vec[l]), max(0ll, vec[l]), vec[l]};
return;
}
int mid = (l+r) >> 1;
build(v*2, l, mid);
build(v*2+1, mid+1, r);
tree[v] = tree[v*2] + tree[v*2+1];
}
void push(int v, int l, int r){
if(lz[v]){
tree[v] += (r-l+1)*lz[v];
if(l != r){
lz[v*2] += lz[v];
lz[v*2+1] += lz[v];
}
lz[v] = 0;
}
}
int get(int v, int l, int r, int val){
if(l == r){
return l;
}
int mid = (l+r) >> 1;
if(tree[v*2] >= val) return get(v*2, l, mid, val);
else return get(v*2+1, mid+1, r, val);
}
void update(int v, int l, int r, int pos, ll val){
if(l == r && l == pos){
tree[v] = {max(0ll, val), max(0ll, val), max(0ll, val), val};
return ;
}
int mid = (l+r) >> 1;
if(pos <= mid) update(v*2, l, mid, pos, val);
else update(v*2+1, mid+1, r, pos, val);
tree[v] = tree[v*2] + tree[v*2+1];
}
ll get_first(){
return tree[1].val;
}
};*/
const int N = 1e5+7;
vector <int> npp;
vector <vector <pii>> graph(N);
int dist[N], n, dist2[N];
vector <set <int>> gg(N);
void dijkstra(){
for(int i = 1; i <= n; i++){
dist[i] = 2e9;
}
for(auto to : npp) dist[to] = 0;
priority_queue <pii> K;
for(auto to : npp) K.push(mp(0, to));
while(sz(K)){
auto v = K.top(); K.pop();
for(auto to : graph[v.second]){
if(dist[to.first] > dist[v.second]+to.second){
dist[to.first] = dist[v.second]+to.second;
K.push(mp(-dist[to.first], to.first));
}
}
}
}
void dijkstra2(int p){
for(int i = 1; i <= n; i++){
dist2[i] = 0;
}
dist2[p] = dist[p];
priority_queue <pii> K;
K.push(mp(-dist2[p], p));
while(sz(K)){
auto v = K.top(); K.pop();
for(auto to : graph[v.second]){
if(dist2[to.first] < dist2[v.second]){
dist2[to.first] = min(dist[to.first], dist2[v.second]);
K.push(mp(-dist2[to.first], to.first));
}
}
}
}
int main(){
do_not_disturb
/*
int n, m;
int i, j;
cin >> n >> m;
int grid[n+1][m+1];
int pref[2][n+2][m+2], suff[2][n+2][m+2];
for(i = 1; i <= n; i++){
for(j = 1; j <= m; j++){
char ch;
cin >> ch;
if(ch == '0') grid[i][j] = 0;
else grid[i][j] = 1;
}
}
*/
int m;
cin >> n >> m;
for(int i = 0; i < m; i++){
int x, y, w;
cin >> x >> y >> w;
graph[x].pb(mp(y, w));
graph[y].pb(mp(x, w));
gg[x].insert(y);
gg[y].insert(x);
}
int k;
cin >> k;
npp.resize(k);
for(auto &to : npp) cin >> to;
dijkstra();
int q;
cin >> q;
while(q--){
int x, y;
cin >> x >> y;
auto t = gg[x];
if(binary_search(all(t), y)){
cout << min(dist[x], dist[y]) << endl;
}
else{
dijkstra2(x);
cout << dist2[y] << endl;
}
}
return 0;
}
/*
6 6
000111a
011111
011111
111000
111000
111000
6 6
000000
111000
111100
001111
000111
000111
*/
