#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i, n) for(int i=0;i<(n);++i)
#define rep1(i, n) for(int i=1;i<=(n);i++)
#define ll long long
using mint = modint998244353;
using P = pair<ll,ll>;
using lb = long double;
using T = tuple<ll, ll, ll>;
#ifdef LOCAL
#  include <debug_print.hpp>
#  define dbg(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define dbg(...) (static_cast<void>(0))
#endif

int main()
{
    int n;
    cin >> n;
    vector<vector<int>> g(n);
    rep(i,n-1){
        int a, b;
        cin >> a >> b;
        --a;--b;
        g[a].push_back(b);
        g[b].push_back(a);
    }
    int m;
    cin >> m;
    vector<int> ex(n);
    rep(i,m) {
        int V;
        cin >> V;
        --V;
        ex[V] = 1;
    }   
    vector<vector<int>> cnt(n);
    rep(i,n){
        for(int v : g[i]){
            if(ex[v]){
                cnt[i].push_back(v);
            }
        }
    }  
    vector<int> inv(n);
    rep(i,n) if(cnt[i].size()==1 && ex[i]==0) inv[cnt[i][0]]++;
    int sum = 0;
    rep(i,n) if(cnt[i].size()>=1 || ex[i]) sum++;
    dbg(sum);
    dbg(inv);
    rep(i,n){
        int ans = sum;
        if(ex[i]==1){
            ans--;
            for(int v : g[i]){
                if(cnt[v].size()==1) ans--;
                ans -= inv[v];
            }
        }
        else{
            if(cnt[i].size()>=2) ans--;
            for(int v : g[i]){
                if(cnt[v].size()==0 && ex[v]==1) ans--;
                ans -= inv[v];
            }

        }
        cout << ans << "\n";
    }
    return 0;
}