#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <queue>
using std::cout;
using std::cin;
using std::make_pair;
using std::min;
using std::max;
using std::pair;
using std::vector;
const int INF=1000000000;
const int MAXN=100005;
vector<pair<int, int> > nei[MAXN];
int dist[MAXN], p[MAXN], val[MAXN], ans[MAXN];
bool used[MAXN];
int parent[MAXN], rank[MAXN];
void make_set (int v);
int find_set (int v);
void union_sets (int a, int b);
void SolveAll(int n, int Q);
void dijkstra(int n, std::priority_queue<pair<int, int> >);
bool dfs(int u, int e, int mindang);
int main()
{
int n, m, k, Q;
cin>>n>>m;
for (int i=0; i<m; i++)
{
int u, v, w;
scanf("%d%d%d", &u, &v, &w);
nei[u].push_back(make_pair(v, w));
nei[v].push_back(make_pair(u, w));
}
std::priority_queue< pair<int,int> > q;
for (int u=1; u<=n; u++)
{
dist[u]=INF;
p[u]=0;
}
cin>>k;
for (int i=0; i<k; i++)
{
int s;
scanf("%d", &s);
dist[s]=0;
q.push(make_pair(0, s));
}
dijkstra(n, q);
cin>>Q;
SolveAll(n, Q);
char I;
cin >> I;
return 0;
}
void SolveAll(int n, int Q)
{
vector<int> dangers;
for (int u=1; u<=n; u++) dangers.push_back(u);
std::sort(dangers.begin(), dangers.end(),
[](const int & a, const int & b) { return dist[a]>dist[b]; });
for (int i=0; i<dangers.size(); i++)
val[dangers[i]]=i;
vector<pair<pair<int, int>, int> > q;
for (int i=0; i<Q; i++)
{
int s, e;
scanf("%d%d", &s, &e);
q.push_back(make_pair(make_pair(s, e), i));
ans[q.size()-1]=-1;
}
std::sort(q.begin(), q.end(),
[] (const pair<pair<int, int>, int> & a, const pair<pair<int, int>, int> & b) {
return max(a.first.first, a.first.second)>max(b.first.first, b.first.second);
});
for (int u=1; u<=n; u++) make_set(u);
int ql=0;
for (int i=0; i<dangers.size(); i++)
{
int curNode=dangers[i];
for (int i=0; i<nei[curNode].size(); i++)
if (dist[nei[curNode][i].first]>=dist[curNode])
union_sets(curNode, nei[curNode][i].first);
for (int i=0; i<q.size(); i++)
{
if (max(q[i].first.first, q[i].first.second)<dist[curNode]) break;
if (ans[i]==-1 && find_set(q[i].first.first)==find_set(q[i].first.second))
ans[i]=dist[curNode];
}
}
for (int i=0; i<q.size(); i++)
cout<<ans[i]<<'\n';
}
void dijkstra(int n, std::priority_queue<pair<int, int> > q)
{
while (!q.empty())
{
int v=q.top().second, cur_d=-q.top().first;
q.pop();
if (cur_d>dist[v]) continue;
for (int j=0; j<nei[v].size(); j++)
{
int to=nei[v][j].first,
len=nei[v][j].second;
if (dist[v]+len<dist[to])
{
dist[to]=dist[v]+len;
p[to]=v;
q.push(make_pair(-dist[to], to));
}
}
}
}
bool dfs(int u, int e, int mindang)
{
if (dist[u]<mindang)
return false;
if (u==e)
return true;
used[u]=true;
bool ans=false;
for (int i=0; i<nei[u].size(); i++)
{
int to=nei[u][i].first;
if (!used[to])
ans|=dfs(to, e, mindang);
}
return ans;
}
void make_set (int v) {
parent[v] = v;
rank[v] = 0;
}
int find_set (int v) {
if (v == parent[v])
return v;
return parent[v] = find_set (parent[v]);
}
void union_sets (int a, int b) {
a = find_set (a);
b = find_set (b);
if (a != b) {
if (rank[a] < rank[b])
std::swap (a, b);
parent[b] = a;
if (rank[a] == rank[b])
++rank[a];
}
}
