#include <random>
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
const int inf = 1e9;
void solve() {
int n, m, q;
cin >> n >> m;
vector<vector<pair<int, int>>> g(n + 1);
for (int i = 0; i < m; i++) {
int u, v, w;
cin >> u >> v >> w;
g[u].emplace_back(v, w);
g[v].emplace_back(u, w);
}
vector<int> danger(n + 1, inf);
{
int k;
cin >> k;
priority_queue<pair<int, int>> pq;
for (int i = 0; i < k; i++) {
int root;
cin >> root;
pq.emplace(0, root);
danger[root] = 0;
}
vector<bool> vis(n + 1);
while (!pq.empty()) {
auto [d, u] = pq.top();
pq.pop();
d = -d;
if (vis[u]) continue;
vis[u] = true;
for (auto [v, w]: g[u]) {
if (danger[v] <= d + w) continue;
danger[v] = d + w;
pq.emplace(-danger[v], v);
}
}
}
const int sq = min(n, 316);
vector<int> roots(n);
iota(roots.begin(), roots.end(), 1);
vector ans(sq, vector(n + 1, 0));
{
shuffle(roots.begin(), roots.end(), mt19937(random_device()()));
while (roots.size() != sq) roots.pop_back();
priority_queue<pair<int, int>> pq;
for (int i = 0; i < sq; i++) {
int root = roots[i];
vector<bool> vis(n + 1);
pq.emplace(danger[root], root);
ans[i][root] = danger[root];
while (!pq.empty()) {
auto [d, u] = pq.top(); pq.pop();
if (vis[u]) continue;
vis[u] = true;
for (auto [v, w]: g[u]) {
if (ans[i][v] >= min(d, danger[v])) continue;
ans[i][v] = min(d, danger[v]);
pq.emplace(ans[i][v], v);
}
}
}
}
vector<bool> vis(n + 1);
vector<int> all(sq);
cin >> q;
while (q--) {
int s, t, best = 0;
cin >> s >> t;
for (int i = 0; i < sq; i++) best = max(best, min(ans[i][s], ans[i][t]));
priority_queue<pair<int, int>> pq; pq.emplace(danger[s], s);
all[0] = s;
vis[s] = true;
int z = 1;
while (!pq.empty()) {
auto [d, u] = pq.top(); pq.pop();
if (u == t) best = max(best, d);
for (auto [v, w]: g[u]) {
if (z == sq) break;
if (vis[v]) continue;
pq.emplace(min(d, danger[v]), v);
vis[v] = true;
all[z++] = v;
}
}
for (int u: all) vis[u] = false;
cout << best << '\n';
}
}
int main() {
srand(time(0));
cin.tie(0)->sync_with_stdio(false);
#ifdef sunnatov
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int queries = 1;
// cin >> queries;
for (int test_case = 1; test_case <= queries; test_case++) {
#ifdef sunnatov
cout << "Test case: " << test_case << endl;
#endif
solve();
cout << '\n';
}
}
