/* be name khoda */
// #define long_enable
#include <iostream>
#include <algorithm>
#include <cstring>
#include <numeric>
#include <vector>
#include <fstream>
#include <set>
#include <map>
using namespace std;
#ifdef long_enable
typedef long long int ll;
#else
typedef int ll;
#endif
typedef pair<ll, ll> pii;
typedef pair<pii, ll> ppi;
typedef pair<ll, pii> pip;
typedef vector<ll> vi;
typedef vector<pii> vpii;
#define forifrom(i, s, n) for (ll i = s; i < n; ++i)
#define forirto(i, n, e) for (ll i = (n) - 1; i >= e; --i)
#define fori(i, n) forifrom (i, 0, n)
#define forir(i, n) forirto (i, n, 0)
#define F first
#define S second
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define smin(a, b) a = min(a, (b))
#define smax(a, b) a = max(a, (b))
#define debug(x) cout << #x << " -> " << (x) << endl
#define debug2(x, y) cout << #x << ' ' << #y << " -> " << (x) << ' ' << (y) << endl
#define debug3(x, y, z) cout << #x << ' ' << #y << ' ' << #z << " -> " << (x) << ' ' << (y) << ' ' << (z) << endl
#define debug4(x, y, z, t) cout << #x << ' ' << #y << ' ' << #z << ' ' << #t << " -> " << (x) << ' ' << (y) << ' ' << (z) << ' ' << (t) << endl
#define debuga(x, n) cout << #x << " -> "; fori (i1_da, n) { cout << (x)[i1_da] << ' '; } cout << endl
#define debugaa(x, n, m) cout << #x << " ->\n"; fori (i1_daa, n) { fori (i2_daa, m) { cout << (x)[i1_daa][i2_daa] << ' '; } cout << '\n'; } cout << endl
const ll MOD = 1000000007;
const ll INF = 2000000000;
const long long BIG = 1446803456761533460LL;
#define XL (x << 1)
#define XR (XL | 1)
#define MD ((l + r) >> 1)
#define Add(a, b) a = ((a) + (b)) % MOD
#define Mul(a, b) a = (1LL * (a) * (b)) % MOD
// -----------------------------------------------------------------------
const ll maxn = 100010;
const ll maxnlg = 20;
ll n, m, Q;
vpii g[maxn];
ll ver[maxn], st[maxn], ft[maxn], pars[maxnlg][maxn];
ll fen[maxn];
ll info[maxn], hist[maxn], state[maxn];
ll tim = 0;
void dfs_init(ll x, ll par) {
st[x] = tim++;
pars[0][x] = par;
fori (i, maxnlg - 1) pars[i + 1][x] = pars[i][pars[i][x]];
for (auto [y, e] : g[x]) if (y != par) {
ver[e] = y;
dfs_init(y, x);
}
ft[x] = tim;
}
void update(ll i, ll v) {
for (++i; i < maxn; i += i & -i) fen[i] += v;
}
ll get(ll i) {
ll s = 0;
for (++i; i; i ^= i & -i) s += fen[i];
return s;
}
ll find_root(ll x) {
ll v = get(st[x]);
forir (i, maxnlg) {
if (get(st[pars[i][x]]) == v) x = pars[i][x];
}
return x;
}
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> n >> m >> Q;
fori (i, n - 1) {
ll a, b; cin >> a >> b; --a, --b;
g[a].eb(b, i), g[b].eb(a, i);
}
dfs_init(0, 0);
fill(info, info + n, 1);
// state = 1 -> open
fori (i, n) update(st[i], 1), update(ft[i], -1);
fori (i, m) {
ll e; cin >> e; --e;
ll x = ver[e];
ll rt = find_root(pars[0][x]);
if (state[e]) {
hist[x] = info[x] = info[rt];
update(st[x], 1), update(ft[x], -1);
} else {
info[rt] += info[x] - hist[x];
update(st[x], -1), update(ft[x], 1);
}
state[e] ^= 1;
}
fori (i, Q) {
ll x; cin >> x; --x;
ll rt = find_root(x);
cout << info[rt] << '\n';
}
}
