#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
istream &operator>>(istream &is, modint &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint &a) { return os << a.val(); }
istream &operator>>(istream &is, modint998244353 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint998244353 &a) { return os << a.val(); }
istream &operator>>(istream &is, modint1000000007 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint1000000007 &a) { return os << a.val(); } 

typedef long long ll;
typedef vector<vector<int>> Graph;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define FOR(i,l,r) for (int i = l;i < (int)(r); i++)
#define rep(i,n) for (int i = 0;i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define my_sort(x) sort(x.begin(), x.end())
#define my_max(x) *max_element(all(x))
#define my_min(x) *min_element(all(x))
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF = (1<<30) - 1;
const ll LINF = (1LL<<62) - 1;
const int MOD = 998244353;
const int MOD2 = 1e9+7;
const double PI = acos(-1);
vector<int> di = {1,0,-1,0};
vector<int> dj = {0,1,0,-1};

#ifdef LOCAL
#  include <debug_print.hpp>
#  define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define debug(...) (static_cast<void>(0))
#endif

const int L = 6;

int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    int N; cin >> N;
    Graph g(N);
    rep(i,N - 1){
        int a, b; cin >> a >> b;
        g[a - 1].push_back(b - 1);
        g[b - 1].push_back(a - 1);
    }

    int M; cin >> M;
    vector<bool> V(N); // お化けがいる
    rep(i,M) {
        int v; cin >> v;
        V[v - 1] = true;
    }

    vector<int> c(N); // 何匹のお化けに囲まれるか
    rep(i,N){
        if(V[i])c[i]++;
        for(int nxt : g[i])if(V[nxt])c[i]++;
    }

    vector<int> d(N); // 囲う頂点が自身だけの隣接頂点数
    rep(i,N){
        if(!V[i])continue;
        for(int nxt : g[i])if(c[nxt] == 1)d[i]++;
    }

    int wa = 0;
    rep(i,N)if(c[i] > 0) wa++;

    rep(i,N){
        int ans = wa;
        if(c[i] > 0) ans--;

        for(int nxt : g[i]){
            if(V[nxt]) { // 隣接頂点のお化けが消えることによる周りの差分
                ans -= d[nxt];
                if(c[i] == 1) ans++; // 自身を引きすぎた分戻す
            }

            if(c[nxt] > 0){ // 隣接頂点自身の差分
                int tmp = c[nxt];
                if(V[i]) tmp--;
                if(V[nxt]) tmp--;

                if(tmp == 0) ans--;
            }
        }
        cout << ans << endl;
    }
}