#include <bits/stdc++.h>
using namespace std;
#define POPCOUNT(n) (__builtin_popcountll((n)))
#define CLZ(n) (__builtin_clzll((n)))
#define CTZ(n) (__builtin_ctzll((n)))
#define LOG(n) (63 - __builtin_clzll((n)))
#define BIT(n, i) (((n) >> (i)) & 1ll)
#define MASK(i) (1ll << (i))
#define FLIP(n, i) ((n) ^ (1ll << (i)))
#define ON(n, i) ((n) | MASK(i))
#define OFF(n, i) ((n) & ~MASK(i))
#define Int __int128
#define fi first
#define se second
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<long long, int> pli;
typedef pair<int, long long> pil;
typedef vector<pair<int, int>> vii;
typedef vector<pair<long long, long long>> vll;
typedef vector<pair<long long, int>> vli;
typedef vector<pair<int, long long>> vil;
template <class T1, class T2> bool maximize(T1 &x, T2 y) {
if (x < y) {
x = y;
return true;
}
return false;
}
template <class T1, class T2> bool minimize(T1 &x, T2 y) {
if (x > y) {
x = y;
return true;
}
return false;
}
template <class T> void remove_duplicate(vector<T> &ve) {
sort (ve.begin(), ve.end());
ve.resize(unique(ve.begin(), ve.end()) - ve.begin());
}
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
long long random(long long l, long long r) {
return uniform_int_distribution<long long>(l, r)(rng);
}
unsigned long long random(unsigned long long l, unsigned long long r) {
return uniform_int_distribution<unsigned long long>(l, r)(rng);
}
template <class T> T random(T r) {
return rng() % r;
}
const int N = 1e5 + 5, LG = 18;
const int MOD = 1e9 + 7;
const int inf = 1e9;
const long long INF = 1e18;
int n, m, q, dfsTime = 0;
int tin[N], tout[N], up[N][LG], ans[N], last_ans[N];
bitset<N> on;
pii edges[N];
vector<int> adj[N];
struct FenwickTree {
using T = int;
vector<T> bit;
FenwickTree() {}
void resize(int n) {
bit.assign(n + 1, 0);
}
void update(int p, T val) {
for (; p < int(bit.size()); p += p & -p) bit[p] += val;
}
void update(int l, int r, int val) {
update(l, val), update(r + 1, -val);
}
T get(int p) {
T ans = 0;
for (; p > 0; p -= p & -p) ans += bit[p];
return ans;
}
} fen;
void dfs(int u, int fa) {
tin[u] = ++dfsTime;
for (auto v : adj[u]) if (v != fa) {
up[v][0] = u;
for (int i = 1; i < LG; ++i) up[v][i] = up[up[v][i - 1]][i - 1];
dfs(v, u);
}
tout[u] = dfsTime;
}
int find_root(int u) {
for (int i = LG - 1; i >= 0; --i) {
int anc = up[u][i];
if (anc > 0 && fen.get(tin[anc]) == fen.get(tin[u]))
u = anc;
}
return u;
}
signed main() {
ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
cin >> n >> m >> q;
for (int i = 1; i < n; ++i) {
int u, v; cin >> u >> v;
adj[u].emplace_back(v), adj[v].emplace_back(u);
edges[i] = make_pair(u, v);
}
dfs(1, -1); fen.resize(n);
for (int i = 1; i < n; ++i) {
auto &[u, v] = edges[i];
if (tin[u] > tin[v]) swap(u, v);
fen.update(tin[v], tout[v], 1);
}
for (int i = 1; i <= n; ++i) ans[i] = 1;
for (int i = 1; i <= m; ++i) {
int d; cin >> d;
auto [u, v] = edges[d];
if (on[d]) {
ans[v] = last_ans[v] = ans[find_root(v)];
fen.update(tin[v], tout[v], 1);
}
else {
fen.update(tin[v], tout[v], -1);
ans[find_root(v)] += ans[v] - last_ans[v];
}
on[d] = !on[d];
}
while (q--) {
int u; cin >> u;
u = find_root(u);
cout << ans[u] << '\n';
}
return 0;
}
