#include <bits/stdc++.h>
#define fi first
#define se second
#define FOR(i, a, b) for (int i = a, _b = b; i <= _b; ++i)
#define FORD(i, a, b) for (int i = a, _b = b; i >= _b; --i)
#define FORLL(i, a, b) for (ll i = a, _b = b; i <= _b; ++i)
#define FORDLL(i, a, b) for (ll i = a, _b = b; i >= _b; --i)
#define all(x) x.begin(), x.end()
#define uni(x) sort(all(x)), x.erase(unique(all(x)), x.end())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define dbg(...) debug(#__VA_ARGS__, __VA_ARGS__)
template<typename T>
void __prine_one(const char *&s, const T &x)
{
while (*s == ' ') ++s;
const char *p = s;
int bal = 0;
while (*s)
{
if (*s == '(') ++bal;
else if (*s == ')') --bal;
else if (*s == ',' && bal == 0) break;
++s;
}
cerr.write(p, s - p) << " = " << x;
if (*s == ',')
{
cerr << " , ";
++s;
}
}
template<typename... Args>
void debug(const char *s, Args... args)
{
cerr << "[ ";
int dummy[] = {0, (__prine_one(s, args), 0)...};
(void)dummy;
cerr << " ]\n\n";
}
template<class X>
bool maximize(X &a, const X &b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
template<class X>
bool minimize(X &a, const X &b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
// --------------------------------------------------------------------------------------------
const int maxn = 1e5 + 3;
int n, m, q, K, dsu[maxn], nx[maxn][20], h[maxn];
vector<int> dang;
ll dist[maxn];
vector<int> krt[maxn];
vector<pii> g[maxn];
bool vis[maxn];
// --------------------------------------------------------------------------------------------
void dijkstra()
{
FOR(i, 1, n)
dist[i] = 1e9;
priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> Q;
for (int u : dang)
{
dist[u] = 0;
Q.push({0ll, u});
}
while (Q.size())
{
ll w = Q.top().fi; int u = Q.top().se; Q.pop();
if (w > dist[u]) continue;
for (const auto &e : g[u])
if (dist[e.fi] > w + e.se)
{
dist[e.fi] = w + e.se;
Q.push({dist[e.fi], e.fi});
}
}
}
int getPar(int u) {return dsu[u] == u ? u : dsu[u] = getPar(dsu[u]);}
void unite(int u, int v)
{
u = getPar(u); v = getPar(v);
if (u == v) return;
dsu[v] = u;
krt[u].push_back(v);
}
void dfs_pre(int u)
{
vis[u] = true;
for (int v : krt[u])
{
if (vis[v]) continue;
h[v] = h[u] + 1;
nx[v][0] = u;
dfs_pre(v);
}
}
int lca(int u, int v)
{
if (h[u] < h[v]) swap(u, v);
FORD(i, 19, 0)
if (h[nx[u][i]] >= h[v])
u = nx[u][i];
if (u == v) return u;
FORD(i, 19, 0)
if (nx[u][i] != nx[v][i])
{
u = nx[u][i];
v = nx[v][i];
}
return nx[u][0];
}
void solve()
{
cin >> n >> m;
FOR(i, 1, m)
{
int u, v, w; cin >> u >> v >> w;
if (u > v) swap(u, v);
g[u].push_back({v, w});
g[v].push_back({u, w});
}
cin >> K;
FOR(i, 1, K)
{
int u; cin >> u;
dang.push_back(u);
}
dijkstra();
vector<int> sorted(n);
iota(all(sorted), 1);
sort(all(sorted), [&](const int &x, const int &y) {
return dist[x] > dist[y];
});
for (int u : sorted)
{
dsu[u] = u;
for (const auto &e : g[u])
{
int v = e.fi;
if (dsu[v])
{
unite(u, v);
}
}
}
FORD(i, (int)sorted.size() - 1, 0)
{
int u = sorted[i];
if (vis[u]) continue;
h[u] = 1;
dfs_pre(u);
}
FOR(j, 1, 19)
FOR(i, 1, n)
nx[i][j] = nx[nx[i][j - 1]][j - 1];
cin >> q;
while (q--)
{
int u, v; cin >> u >> v;
if (u > v) swap(u, v);
int l = lca(u, v);
cout << dist[l] << '\n';
}
}
signed main()
{
ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define TASK "TEST"
if (fopen(TASK".INP", "r"))
{
freopen(TASK".INP", "r", stdin);
freopen(TASK".OUT", "w", stdout);
}
solve();
return 0;
}
