#include<iostream>
#include<cstring>
#include<vector>
#include<array>
#include<algorithm>
using namespace std;
using LL = long long;

// 1_based HLD
// struct Edge{
//     int to;
//     int w;
//     operator int() const { return to; }
// };

using Edge = int;
struct HLD{
    int n;
    vector<int> sz, top, dep, fa, in, out, seq;
    vector<vector<Edge> > g;
    int ts;

    HLD(const vector<vector<Edge> > &g, int root = 1) : n(int(g.size()) - 1), g(g)  {
        ts = 0;
        sz.resize(n + 1);
        top.resize(n + 1);
        dep.resize(n + 1);
        fa.resize(n + 1);
        in.resize(n + 1);
        out.resize(n + 1);
        seq.resize(n + 1);
        dep[root] = 1;
        top[root] = root;
        dfs_sz(root);
        dfs_hld(root);
    }

    void dfs_sz(int u){
        if (fa[u]){
            for(auto it = g[u].begin(); it != g[u].end(); it++){
                if (*it == fa[u]){
                    g[u].erase(it);
                    break;
                }
            }
        }
        sz[u] = 1;
        for(auto &j : g[u]){
            fa[j] = u;
            dep[j] = dep[u] + 1;
            dfs_sz(j);
            sz[u] += sz[j];
            if (sz[j] > sz[g[u][0]])
                swap(j, g[u][0]);
        }
    }

    void dfs_hld(int u){
        in[u] = ++ts;
        seq[in[u]] = u;
        for (auto j : g[u]){
            top[j] = (j == g[u][0] ? top[u] : j);
            dfs_hld(j);
        }
        out[u] = ts;
    }

    int lca(int u, int v){
        while (top[u] != top[v]){
            if (dep[top[u]] > dep[top[v]]){
                u = fa[top[u]];
            } 
            else{
                v = fa[top[v]];
            }
        }
        return dep[u] < dep[v] ? u : v;
    }

    int dist(int u, int v){
        return dep[u] + dep[v] - 2 * dep[lca(u, v)];
    }

    bool in_subtree(int u, int v){
        return in[v] <= in[u] && in[u] <= out[v];
    }
    
    int jump(int u, int k) {
        if (dep[u] < k){
            return -1;
        }
        int d = dep[u] - k;
        while (dep[top[u]] > d){
            u = fa[top[u]];
        }
        return seq[in[u] - dep[u] + d];
    }
    
    int rooted_lca(int a, int b, int c){
        return lca(a, b) ^ lca(b, c) ^ lca(c, a);
    }

    template<typename Q>
    void modify_path(int u, int v, const Q &q, bool edge = false){
        while(top[u] != top[v]){
            if (dep[top[u]] < dep[top[v]]) swap(u, v);
            q(in[top[u]], in[u]);
            u = fa[top[u]];        
        }
        if (dep[u] > dep[v]) swap(u, v);
        q(in[u] + edge, in[v]);
    }

    template<typename Q>
    void modify_subtree(int u, const Q &q){
        q(in[u], out[u]);
    }  

    template<typename T, typename Q>
    T query_path(int u, int v, const Q &q, bool edge = false){
        T ret = T();
        while(top[u] != top[v]){
            if (dep[top[u]] < dep[top[v]]) swap(u, v);
            ret = q(in[top[u]], in[u]) + ret;
            u = fa[top[u]];
        }
        if (dep[u] > dep[v]) swap(u, v);
        return q(in[u] + edge, in[v]) + ret;
    }

    template<typename T, typename Q>
    T query_subtree(int u, const Q &q){
        return q(in[u], out[u]);
    }

    template<typename T, typename Q, typename F>
    T query_path_noncommutative(int u, int v, const Q &q, const F &f, bool edge = false){
        T left = T(), right = T();
        while(top[u] != top[v]){
            if (dep[top[u]] < dep[top[v]]) swap(u, v), swap(left, right);
            left = q(in[top[u]], in[u]) + left;
            u = fa[top[u]];
        }
        if (dep[u] > dep[v]) swap(u, v), swap(left, right);
        return f(left, q(in[u] + edge, in[v]) + right);
    }
    
    pair<vector<int>, vector<pair<int, int> > > compress(vector<int> v){
        auto cmp = [&](int a, int b) { return in[a] < in[b]; };
        sort(v.begin(), v.end(), cmp);
        v.erase(unique(v.begin(), v.end()), v.end());
        const int k = (int)v.size();
        for(int i = 0; i + 1 < k; i++){
            v.push_back(lca(v[i], v[i + 1]));
        }
        sort(v.begin(), v.end(), cmp);
        v.erase(unique(v.begin(), v.end()), v.end());
        vector<pair<int, int> > edges;
        vector<int> stk;
        for(auto x : v){
            while(!stk.empty() && out[stk.back()] < in[x]){
                stk.pop_back();
            }
            if (!stk.empty()){
                edges.push_back({stk.back(), x});
            }
            stk.push_back(x);
        }
        return {v, edges};
    }

};

const int maxn = 2e5 + 5;
array<int, 2> dp[maxn][3];

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    int n, m, q;
    cin >> n >> m >> q;
    vector<vector<int> > g(n + 1);
    for(int i = 0; i < n - 1; i++){
        int a, b;
        cin >> a >> b;
        g[a].push_back(b);
        g[b].push_back(a);
    }

    HLD hld(g);

    vector<int> b(m + 1);
    for(int i = 1; i <= m; i++) cin >> b[i];
    const int len = 450;

    vector<int> id(m + 1), L, R;
    const int INF = 1e9;
    vector<int> ok(n + 1);

    // 从x开始的三个是否可以
    auto check = [&](int i){
        int x = b[i], y = b[i + 1], z = b[i + 2];
        if (hld.in_subtree(x, y)){
            if (hld.in_subtree(y, z)) return true;
            int anc = hld.lca(x, z);
            return hld.dep[anc] <= hld.dep[y];
        }
        else if (hld.in_subtree(z, y)){
            if (hld.in_subtree(y, x)) return true;
            int anc = hld.lca(x, z);
            return hld.dep[anc] <= hld.dep[y];
        }
        return false;
    };

    auto build = [&](int id){
        int l = L[id], r = R[id];
        {
            int ans = 1, lastcnt = 1;
            for(int i = l + 1; i <= r; i++){
                if (lastcnt == 1){
                    lastcnt += 1;
                    ans += 1;
                }
                else{
                    if (ok[i - 2]){
                        lastcnt += 1;
                    }
                    else{
                        ans += 1;
                        lastcnt = 2;
                    }
                }
            }    
            dp[id][0] = {ans, lastcnt};
        }
        if (l - 1 >= 1){
            int ans = 0, lastcnt = 1;
            for(int i = l; i <= r; i++){
                if (lastcnt == 1){
                    lastcnt += 1;
                    ans += 1;
                }
                else{
                    if (ok[i - 2]){
                        lastcnt += 1;
                    }
                    else{
                        ans += 1;
                        lastcnt = 2;
                    }
                }
            }
            dp[id][1] = {ans, lastcnt};
        }
        else{
            dp[id][1] = {INF, INF};
        }
        if (l - 2 >= 1){
            int ans = 0, lastcnt = 2;
            for(int i = l; i <= r; i++){
                if (lastcnt == 1){
                    lastcnt += 1;
                    ans += 1;
                }
                else{
                    if (ok[i - 2]){
                        lastcnt += 1;
                    }
                    else{
                        ans += 1;
                        lastcnt = 2;
                    }
                }
            }
            dp[id][2] = {ans, lastcnt};
        }
        else{
            dp[id][2] = {INF, INF};
        }
    };

    for(int i = 1; i + 2 <= n; i++){
        ok[i] = check(i);
    }

    for(int i = 1, k = 0; i <= m; i += len, k += 1){
        int l = i, r = min(m, i + len - 1);
        for(int j = l; j <= r; j++){
            id[j] = k;
        }
        L.push_back(l);
        R.push_back(r);
        build(k);
    }

    auto get = [&](){
        auto [ans, lastcnt] = dp[0][0];
        for(int i = 1; i < L.size(); i++){
            ans += dp[i][lastcnt][0];
            lastcnt = dp[i][lastcnt][1];
        } 
        return ans;
    };

    for(int i = 0; i < q; i++){
        int x, y;
        cin >> x >> y;
        b[x] = y;
        for(int j = x - 2; j <= x; j++){
            if (j >= 1 and j + 2 <= n){
                ok[j] = check(j);
            }
        }
        build(id[x]);
        if (id[x] + 1 < L.size()) build(id[x] + 1);
        cout << get() << '\n';
    }

}