#include<bits/stdc++.h>
/*
#pragma optimize ("g",on)
#pragma GCC optimize("inline")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("03")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,avx2,mmx,fma,avx,tune=native")
*/
//01001101 01100001 01101011 01101000 01100001 01100111 01100001 01111001
using namespace std;
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define ll long long
#define pb push_back
#define sz(a) a.size()
#define nl '\n'
#define popb pop_back()
#define ld double
#define ull unsigned long long
#define ff first
#define ss second
#define fix fixed << setprecision
#define pii pair<int, int>
#define E exit (0)
#define int long long
const int inf = 1e18, N = 2e5 + 1, mod = 998244353;
vector<pii> dir = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
main() {
//freopen("cowrect.in", "r", stdin);
//freopen("cowrect.out", "w", stdout);
ios_base::sync_with_stdio(NULL);
cin.tie(NULL);
int n, m;
cin >> n >> m;
vector<pii> adj[n + 1];
for (int i = 1; i <= m; i++) {
int u, v, w;
cin >> u >> v >> w;
adj[u].pb({v, w});
adj[v].pb({u, w});
}
int k;
cin >> k;
set<pii> s;
vector<int> d(n + 1, inf);
for (int i = 1; i <= k; i++) {
int a;
cin >> a;
s.insert({0, a});
d[a] = 0;
}
while (!s.empty()) {
int u = (*s.begin()).ss;
s.erase(s.begin());
for (auto e: adj[u]) {
if (d[e.ff] > d[u] + e.ss) {
s.erase({d[e.ff], e.ff});
d[e.ff] = d[u] + e.ss;
s.insert({d[e.ff], e.ff});
}
}
}
int q;
cin >> q;
if ((q <= 200 && m <= 200 && n <= 15) || q == 1) {
while (q--) {
int u, v;
cin >> u >> v;
s.insert({d[u], u});
vector<int> dst(n + 1, -inf);
dst[u] = d[u];
while (!s.empty()) {
int u = (*s.begin()).ss;
s.erase(s.begin());
for (auto e: adj[u]) {
if (dst[e.ff] < min(dst[u], d[e.ff])) {
s.erase({dst[e.ff], e.ff});
dst[e.ff] = min(dst[u], d[e.ff]);
s.insert({dst[e.ff], e.ff});
}
}
}
cout << dst[v] << nl;
}
} else {
while (q--) {
int u, v;
cin >> u >> v;
cout << min(d[u], d[v]) << nl;
}
}
}
