#include <iostream>
#include <iomanip>
#include <fstream>
#include <algorithm>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <cmath>
#include <list>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
#define all(x) x.begin(),x.end()
#define al(a,n) (a,a+n)
#define se second
#define fr first
#define m_p make_pair
const ll N = 2000005;
const ll mod = 1000 * 1000 * 1000 + 7;
const ll inf = 1000000009;
ll n, m, k, z, t, x, y, ans, pat, a[N],dist[N];
bool color[N];
vector<pair<ll, ll>> g[N];
pair<ll, ll> p;
int main()
{
cin >> n >> m;
for (int i = 0; i < m; ++i)
{
cin >> x >> y >> z;
g[x].push_back({ y,z });
g[y].push_back({ x,z });
}
cin >> k;
for (int i = 0; i < k; ++i)
{
cin >> x;
a[x] = 1;
}
for (int i = 1; i <= n; i++)
dist[i] = mod;
for (int i = 0; i < k; ++i)
{
priority_queue<pair<ll, ll>> pq;
dist[a[i]] = 0;
for (int i = 1; i <= n; i++)
color[i] = false;
pq.push(m_p(0, a[i]));
ll min_i;
for (int i = 0; i < m; i++)
{
while (!pq.empty())
{
p = pq.top();
pq.pop();
if (!color[p.second])
{
min_i = p.second;
break;
}
}
color[min_i] = true;
y = g[min_i].size();
for (int j = 0; j < y; j++)
{
int h = g[min_i][j].first;
int d = g[min_i][j].second;
if (!color[h] && dist[h] > dist[min_i] + d)
{
dist[h] = dist[min_i] + d;
pq.push(m_p(-dist[h], h));
}
}
}
}
cin >> ans;
for (int i = 0; i < ans; ++i)
{
cin >> x >> y;
cout << min(dist[x], dist[y]) << endl;
}
return 0;
}
