/*
ЗАПУСКАЕМ
░ГУСЯ░▄▀▀▀▄░РАБОТЯГУ░░
▄███▀░◐░░░▌░░░░░░░
░░░░▌░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▌░░░░░▐▄▄░░░░░
░░░░▌░░░░▄▀▒▒▀▀▀▀▄
░░░▐░░░░▐▒▒▒▒▒▒▒▒▀▀▄
░░░▐░░░░▐▄▒▒▒▒▒▒▒▒▒▒▀▄
░░░░▀▄░░░░▀▄▒▒▒▒▒▒▒▒▒▒▀▄
░░░░░░▀▄▄▄▄▄█▄▄▄▄▄▄▄▄▄▄▄▀▄
░░░░░░░░░░░▌▌░▌▌░░░░░
░░░░░░░░░░░▌▌░▌▌░░░░░
░░░░░░░░░▄▄▌▌▄▌▌░░░░░
*/
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <iomanip>
#include <deque>
using namespace std;
template<typename T1, typename T2>inline void chkmin(T1 &x, T2 y) { if (x > y) x = y; }
template<typename T1, typename T2>inline void chkmax(T1 &x, T2 y) { if (x < y) x = y; }
template<typename T, typename U> inline ostream &operator<< (ostream &_out, const pair<T, U> &_p) { _out << _p.first << ' ' << _p.second; return _out; }
template<typename T, typename U> inline istream &operator>> (istream &_in, pair<T, U> &_p) { _in >> _p.first >> _p.second; return _in; }
template<typename T> inline ostream &operator<< (ostream &_out, const vector<T> &_v) { if (_v.empty()) { return _out; } _out << _v.front(); for (auto _it = ++_v.begin(); _it != _v.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline istream &operator>> (istream &_in, vector<T> &_v) { for (auto &_i : _v) { _in >> _i; } return _in; }
template<typename T> inline ostream &operator<< (ostream &_out, const set<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline ostream &operator<< (ostream &_out, const multiset<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline ostream &operator<< (ostream &_out, const unordered_set<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline ostream &operator<< (ostream &_out, const unordered_multiset<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T, typename U> inline ostream &operator<< (ostream &_out, const map<T, U> &_m) { if (_m.empty()) { return _out; } _out << '(' << _m.begin()->first << ": " << _m.begin()->second << ')'; for (auto _it = ++_m.begin(); _it != _m.end(); ++_it) { _out << ", (" << _it->first << ": " << _it->second << ')'; } return _out; }
template<typename T, typename U> inline ostream &operator<< (ostream &_out, const unordered_map<T, U> &_m) { if (_m.empty()) { return _out; } _out << '(' << _m.begin()->first << ": " << _m.begin()->second << ')'; for (auto _it = ++_m.begin(); _it != _m.end(); ++_it) { _out << ", (" << _it->first << ": " << _it->second << ')'; } return _out; }
#define sz(c) (int)(c).size()
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define left left228
#define right right228
#define next next228
#define rank rank228
#define prev prev228
#define y1 y1228
#define read(FILENAME) freopen((FILENAME + ".in").c_str(), "r", stdin)
#define write(FILENAME) freopen((FILENAME + ".out").c_str(), "w", stdout)
#define files(FILENAME) read(FILENAME), write(FILENAME)
#define pb push_back
#define x first
#define y second
const string FILENAME = "input";
const int MAXN = 100228;
//11:50
//16:50
int n, m;
vector<pair<int, int> > g[MAXN];
int id[MAXN];
int dist[MAXN];
int s[MAXN], t[MAXN];
int l[MAXN], r[MAXN];
bool good[MAXN];
int parent[MAXN];
vector<int> need[MAXN];
int findset(int a) {
if (a == parent[a]) {
return a;
}
return parent[a] = findset(parent[a]);
}
void makeset(int a) {
parent[a] = a;
}
void setunion(int a, int b) {
a = findset(a);
b = findset(b);
if (a == b) {
return;
}
parent[a] = b;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
//read(FILENAME);
cin >> n >> m;
for (int i = 0; i < m; i++){
int a, b, c;
cin >> a >> b >> c;
a--, b--;
g[a].pb({b, c});
g[b].pb({a, c});
}
int k;
cin >> k;
for (int i = 0; i < k; i++) {
cin >> id[i];
id[i]--;
}
for (int i = 0; i < n; i++) {
dist[i] = 1e9;
}
set<pair<int, int> > ss;
for (int i = 0; i < k; i++) {
dist[id[i]] = 0;
ss.insert({0, id[i]});
}
//return 0;
while (!ss.empty()) {
pair<int, int> p = *ss.begin();
ss.erase(p);
int u = p.second;
for (auto h: g[u]) {
if (dist[h.first] > dist[u] + h.second) {
ss.erase({dist[h.first], h.first});
dist[h.first] = dist[u] + h.second;
ss.insert({dist[h.first], h.first});
}
}
}
// return 0;
int q;
cin >> q;
for (int i = 0; i < q; i++) {
cin >> s[i] >> t[i];
s[i]--, t[i]--;
}
vector<pair<int, int> > st;
for (int i = 0; i < n; i++) {
st.pb({dist[i], i});
}
sort(all(st));
reverse(all(st));
for (int i = 0; i < q; i++) {
l[i] = 0;
r[i] = n - 1;
}
while (true) {
bool was = false;
for (int i = 0; i < n; i++) {
need[i].clear();
}
for (int i = 0; i < q; i++) {
if (l[i] != r[i]) {
int mid = (l[i] + r[i]) >> 1;;
need[mid].pb(i);
was = true;
}
}
if (!was) {
break;
}
for (int i = 0; i < n; i++) {
makeset(i);
good[i] = false;
}
for (int i = 0; i < n; i++) {
good[st[i].second] = true;
for (auto x: g[st[i].second]) {
if (good[x.first]) {
setunion(x.first, st[i].second);
}
}
for (auto x: need[i]) {
if (findset(s[x]) != findset(t[x])) {
l[x] = i + 1;
} else {
r[x] = i;
}
}
}
}
for (int i = 0; i < q; i++) {
cout << st[l[i]].first << '\n';
}
}
