#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
#define block_of_code if(true)
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
double cur = rngesus(0, MASK(60) - 1);
cur /= MASK(60) - 1;
return l + cur * (r - l);
}
template <class T1, class T2>
bool maximize(T1 &a, T2 b){
if (a < b) {a = b; return true;}
return false;
}
template <class T1, class T2>
bool minimize(T1 &a, T2 b){
if (a > b) {a = b; return true;}
return false;
}
template <class T>
void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
for(auto item: container) out << item << separator;
out << finish;
}
template <class T>
void remove_dup(vector<T> &a){
sort(ALL(a));
a.resize(unique(ALL(a)) - a.begin());
}
const int N = 1e5 + 69, LOG_N = 17;
int n, m, q;
int sum1[N], sum2[N];
vector<int> graph[N];
int h[N], parent[N][LOG_N], in[N], out[N];
struct FenwickTree{
int n;
vector<int> a;
FenwickTree(int _n){
n = _n;
a.resize(n+1);
}
void update(int i, int v){
while(i <= n){
a[i] += v;
i += LASTBIT(i);
}
}
void update(int l, int r, int v){
update(l, v); update(r+1, -v);
}
int get(int i){
int ans = 0;
while(i > 0){
ans += a[i];
i -= LASTBIT(i);
}
return ans;
}
};
void dfs(int u, int p){
h[u] = h[p] + 1;
in[u] = out[u] = ++in[0];
for(int j = 1; MASK(j) < h[u]; ++j)
parent[u][j] = parent[parent[u][j-1]][j-1];
for(int v: graph[u]) if (v != p){
parent[v][0] = u;
dfs(v, u);
maximize(out[u], out[v]);
}
}
int get_father(int u, FenwickTree &bit){
int cu = bit.get(in[u]);
for(int j = LOG_N - 1; j>=0; --j) if (parent[u][j] != 0){
int v = parent[u][j];
if (bit.get(in[v]) == cu) u = v;
}
return u;
}
int main(void){
ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
clock_t start = clock();
cin >> n >> m >> q;
vector<pair<int, int>> edge = {{0, 0}};
for(int i = 1; i<n; ++i){
int u, v; cin >> u >> v;
edge.push_back({u, v});
graph[u].push_back(v);
graph[v].push_back(u);
}
dfs(1, 0);
for(pair<int, int> &i: edge) if (h[i.first] > h[i.second]) swap(i.first, i.second);
FenwickTree bit(n);
for(int i = 1; i<=n; ++i) {
bit.update(in[i], out[i], 1);
sum1[i] = sum2[i] = 1;
}
vector<int> exist(n);
while(m--){
int x; cin >> x;
int u, v;
tie(u, v) = edge[x];
if (exist[x]){
u = get_father(u, bit);
sum2[v] = sum2[u];
sum1[v] = 0;
bit.update(in[v], out[v], 1);
}
else{
u = get_father(u, bit), v = get_father(v, bit);
sum2[u] += sum1[v];
sum1[u] += sum1[v];
bit.update(in[v], out[v], -1);
}
exist[x] ^= 1;
}
cout << "\n";
while(q--){
int x; cin >> x;
x = get_father(x, bit);
cout << sum2[x] << "\n";
}
cerr << "Time elapsed: " << clock() - start << " ms\n";
return 0;
}
