#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_map>
#include <cmath>
#include <climits>
#include <algorithm>
#include <random>
#include <queue>
#include <deque>
#include <iomanip>
#include <string>
#include <tuple>
#include <bitset>
#include <chrono>
#include <ctime>
#include <fstream>
#include <stack>
using namespace std;
using ll = long long;
const int N = 1e5 + 5;
const ll mod = 1e9 + 7, inf = 1e18;
int n, m, k, q;
vector<vector<pair<int, ll>>> gp;
vector<ll> g, mind;
vector<ll> dp;
void dfs(int u, vector<bool> vis, int y) {
vis[u] = 1;
if (u == y) {
dp[u] = mind[y];
return;
}
for (pair<int, ll> &v : gp[u]) {
if (!vis[v.first]) {
dfs(v.first, vis, y);
dp[u] = max(dp[u], dp[v.first]);
}
}
dp[u] = min(dp[u], mind[u]);
}
void solve() {
cin >> n >> m;
gp = vector<vector<pair<int, ll>>>(n);
mind = vector<ll>(n, 1e18);
for (int i = 0; i < m; ++i) {
int u, v, w; cin >> u >> v >> w;
gp[--u].push_back({ --v, w });
gp[v].push_back({ u, w });
}
cin >> k;
g = vector<ll>(k);
priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> pq;
for (int i = 0; i < k; ++i) cin >> g[i], --g[i], pq.push({ 0, g[i] }), mind[g[i]] = 0;
while (pq.size()) {
pair<ll, int> p = pq.top();
pq.pop();
ll d = p.first, u = p.second;
if (mind[u] < d) continue;
for (pair<int, ll> v : gp[u]) {
if (mind[v.first] > mind[u] + v.second) {
mind[v.first] = mind[u] + v.second;
pq.push({ mind[v.first], v.first });
}
}
}
cin >> q;
while (q--) {
int s, t; cin >> s >> t; --s, --t;
vector<bool>vis(n);
dp = vector<ll>(n, -1);
dfs(s, vis, t);
cout << dp[s] << endl;
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
int _; cin >> _; while (_--)
solve();
}
