#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_DEPRECATE

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <limits>
#include <ctime>
#include <cassert>
#include <map>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <stack>
#include <queue>
#include <numeric>
#include <iterator>
#include <bitset>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;

#define FOR(i,n) for(int i = 0; i < (n); i++)
#define sz(c) ((int)(c).size())
#define ten(x) ((int)1e##x)

// #pragma comment(linker,"/STACK:36777216")

template<class T> void chmax(T& l, const T r) { l = max(l, r); }
template<class T> void chmin(T& l, const T r) { l = min(l, r); }

#ifdef _WIN32
#   define mygc(c) (c)=getchar()
#   define mypc(c) putchar(c)
#else
#   define mygc(c) (c)=getchar_unlocked()
#   define mypc(c) putchar_unlocked(c)
#endif

void reader(int& x) { int k, m = 0; x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k&&k <= '9') { x = k - '0'; break; } }for (;;) { mygc(k); if (k<'0' || k>'9')break; x = x * 10 + k - '0'; }if (m) x = -x; }
void reader(ll& x) { int k, m = 0; x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k&&k <= '9') { x = k - '0'; break; } }for (;;) { mygc(k); if (k<'0' || k>'9')break; x = x * 10 + k - '0'; }if (m) x = -x; }
int reader(char c[]) { int i, s = 0; for (;;) { mygc(i); if (i != ' '&&i != '\n'&&i != '\r'&&i != '\t'&&i != EOF) break; }c[s++] = i; for (;;) { mygc(i); if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break; c[s++] = i; }c[s] = '\0'; return s; }
template <class T, class S> void reader(T& x, S& y) { reader(x); reader(y); }
template <class T, class S, class U> void reader(T& x, S& y, U& z) { reader(x); reader(y); reader(z); }
template <class T, class S, class U, class V> void reader(T& x, S& y, U& z, V & w) { reader(x); reader(y); reader(z); reader(w); }

void writer(int x, char c) { int s = 0, m = 0; char f[10]; if (x<0)m = 1, x = -x; while (x)f[s++] = x % 10, x /= 10; if (!s)f[s++] = 0; if (m)mypc('-'); while (s--)mypc(f[s] + '0'); mypc(c); }
void writer(ll x, char c) { int s = 0, m = 0; char f[20]; if (x<0)m = 1, x = -x; while (x)f[s++] = x % 10, x /= 10; if (!s)f[s++] = 0; if (m)mypc('-'); while (s--)mypc(f[s] + '0'); mypc(c); }
void writer(const char c[]) { int i; for (i = 0; c[i] != '\0'; i++)mypc(c[i]); }
void writer(const char x[], char c) { int i; for (i = 0; x[i] != '\0'; i++)mypc(x[i]); mypc(c); }
template<class T> void writerLn(T x) { writer(x, '\n'); }
template<class T, class S> void writerLn(T x, S y) { writer(x, ' '); writer(y, '\n'); }
template<class T, class S, class U> void writerLn(T x, S y, U z) { writer(x, ' '); writer(y, ' '); writer(z, '\n'); }
template<class T> void writerArr(T x[], int n) { if (!n) { mypc('\n'); return; }FOR(i, n - 1)writer(x[i], ' '); writer(x[n - 1], '\n'); }

class DominatorTree {
	vector<int> dfnum, vertex, parent, ancestor, semi, samedom, best;
	vector<vector<int>> bucket;

	vector<vector<int>> G, rG;

	void dfs(int p, int n, int &k){
		if (dfnum[n] == 0 && !(n == 0 && p > 0)) {
			dfnum[n] = k;
			vertex[k++] = n;
			parent[n] = p;
			for (int i = 0; i < G[n].size(); i++) {
				dfs(n, G[n][i], k);
			}
		}
	}

	int ancestorWithLowestSemi(int v){
		int a = ancestor[v];
		if (ancestor[a]>0) {
			int b = ancestorWithLowestSemi(a);
			ancestor[v] = ancestor[a];
			if (dfnum[semi[b]] < dfnum[semi[best[v]]])best[v] = b;
		}
		return best[v];
	}

	void link(int p, int n){
		ancestor[n] = p;
		best[n] = n;
	}

public:
	vector<int> idom;

	void run(int root){
		for (int i = 0; i < sz(G); i++) bucket[i].clear();

		int N = 0;
		dfs(0, root, N);

		for (int i = N - 1; i > 0; i--) {
			int n = vertex[i], p = parent[n], s = p;
			for (int j = 0; j < rG[n].size(); j++) {
				int v = rG[n][j], s1;
				if (dfnum[v] <= dfnum[n])s1 = v;
				else s1 = semi[ancestorWithLowestSemi(v)];

				if (dfnum[s1] < dfnum[s])s = s1;
			}
			semi[n] = s;
			bucket[s].push_back(n);
			link(p, n);
			for (int j = 0; j < bucket[p].size(); j++) {
				int v = bucket[p][j], y = ancestorWithLowestSemi(v);
				if (semi[y] == semi[v])idom[v] = p;
				else samedom[v] = y;
			}
			bucket[p].clear();
		}

		for (int i = 1; i < N; i++) {
			int n = vertex[i];
			if (samedom[n]>0) {
				idom[n] = idom[samedom[n]];
			}
		}

		for (int i = 1; i < N; i++) {
			for (int j = 0; j < rG[i].size(); j++) {
				if (rG[i][j] == root)idom[i] = 0;
			}
		}
	}

	DominatorTree(vector<vector<int>>& g) :
		dfnum(sz(g)), vertex(sz(g)), parent(sz(g)), ancestor(sz(g)),
		idom(sz(g)), semi(sz(g)), samedom(sz(g)), best(sz(g)), bucket(sz(g)), G(g)
	{
		rG.resize(sz(g));
		FOR(i, sz(g)) for (auto to : g[i]) rG[to].push_back(i);
	}
};

int main(){
	int n, m; reader(n, m);
	vector<vector<int>> g(n);
	FOR(i, m){
		int s, t; reader(s, t); s--; t--;
		g[s].push_back(t);
	}

	DominatorTree dt(g);
	dt.run(0);

	int q; reader(q);
	FOR(i, q){
		int t; reader(t); t--;
		int idom = dt.idom[t];
		if (idom == 0) idom = t;
		writerLn(idom + 1);
	}
}

Measured memory_bytes: 26272