#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
using pli = pair<ll,int>;
const int N = 1e5 + 5, M = 5e5 + 5;
const ll inf = 1e15; // beaware may not enough
vector<pli> adj[N];
ll D[N], mn[N][20];
bool vis[N];
tuple<int,int,int> E[M];
tuple<ll,int,int> edges[M];
int p[N], up[N][20], dep[N], LOG, sz[N];
int fp(int x){if(x == p[x]) return x; return p[x] = fp(p[x]);}
void dfs(int u, int p, ll wp){
up[u][0] = p; mn[u][0] = wp;
if(u != p) dep[u] = dep[p] + 1;
for(int j = 1; j<LOG; ++j){
up[u][j] = up[up[u][j-1]][j-1];
mn[u][j] = min(mn[u][j-1], mn[up[u][j-1]][j-1]);
}
for(pli it: adj[u]){
ll w = it.first; int v = it.second;
if(v != p) dfs(v, u, w);
}
}
pair<ll,int> get_lca(int u, int v){
ll w = inf;
if(u == v) return make_pair(w, u);
if(dep[u] < dep[v]) swap(u, v);
for(int j = LOG-1; j>=0; --j) if((dep[u]-dep[v])>>j&1) w = min(w, mn[u][j]), u = up[u][j];
if(u == v) return make_pair(w, u);
for(int j = LOG-1; j>=0; --j) if(up[u][j] != up[v][j]){w = min({w, mn[u][j], mn[v][j]}); u = up[u][j]; v = up[v][j];}
return make_pair(min(w, mn[u][0]), up[u][0]);
}
signed main(){
int n, m; scanf("%d %d", &n, &m); LOG = 32 - __builtin_clz(n);
for(int i = 0, u, v, w; i<m; ++i){
scanf("%d %d %d", &u, &v, &w); --u; --v;
E[i] = make_tuple(u, v, w);
adj[u].emplace_back(w, v); adj[v].emplace_back(w, u);
}
priority_queue<pli, vector<pli>, greater<pli>> pq;
fill(D, D+n, inf); fill(vis, vis+n, false);
int k; scanf("%d", &k);
for(int i = 0, u; i<k; ++i) scanf("%d", &u), pq.emplace(D[u-1] = 0, u-1);
while(!pq.empty()){
int u = pq.top().second; pq.pop();
if(vis[u]) continue; vis[u] = true;
for(pli it: adj[u]){
ll w = it.first; int v = it.second;
if(D[u] + w < D[v]) pq.emplace(D[v] = D[u] + w, v);
}
}
for(int i = 0; i<m; ++i){
int u, v, _; tie(u, v, _) = E[i];
edges[i] = make_tuple(min(D[u], D[v]), u, v);
}
for(int i = 0; i<n; ++i){
adj[i].clear(); p[i] = i; sz[i] = 1; fill(mn[i], mn[i]+LOG, inf);
}
sort(edges, edges+m, greater<tuple<ll,int,int>>());
for(int i = 0; i<m; ++i){
ll w; int u, v; tie(w, u, v) = edges[i];
if(fp(u) != fp(v)){
int pu = fp(u), pv = fp(v);
if(sz[pu] < sz[pv]) swap(pu, pv);
sz[pu] += sz[pv]; p[pv] = pu;
adj[u].emplace_back(w, v); adj[v].emplace_back(w, u);
}
}
dfs(0, 0, inf);
int q; scanf("%d", &q);
while(q--){
int u, v; scanf("%d %d", &u, &v); --u; --v;
pair<ll,int> tmp = get_lca(u, v);
ll w = tmp.first; int lca = tmp.second;
printf("%lld\n", w);
}
}
