#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint998244353;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

int main() {
    ll N;
    cin >> N;
    vector<ll> A(N - 1);
    vector<ll> B(N - 1);
    rep(i, N - 1){
        cin >> A[i] >> B[i];
        A[i]--;
        B[i]--;
    }
    vector<vector<ll>> graph(N, vector<ll>(0));
    rep(i, N - 1){
        graph[A[i]].push_back(B[i]);
        graph[B[i]].push_back(A[i]);
    }
    ll M;
    cin >> M;
    vector<ll> V(M);
    rep(i, M){
        cin >> V[i];
        V[i]--;
    }
    vector<bool> has(N, false);
    rep(i, M) has[V[i]] = true;
    // 何個の頂点と隣り合っているか？　の情報を別で持っておくことにする
    vector<ll> cnts(N, 0);
    rep(i, N){
        if (has[i]) cnts[i]++;
        rep(j, graph[i].size()){
            if (has[graph[i][j]]) cnts[i]++;
        }
    }
    vector<ll> adj_one(N, 0);
    for (ll i = 0; i < N; i++){
        for (ll j = 0; j < graph[i].size(); j++){
            if (cnts[graph[i][j]] == 1){
                adj_one[i]++;
            }
        }
    }
    // debug(adj_one);
    ll root = 0;
    rep(i, N){
        if (cnts[i] > 0) root++;
    }
    for (ll i = 0; i < N; i++){
        ll ans = root;
        if (has[i]) ans--;
        else{
            ll pt_r = 0;
            for (ll j = 0; j < graph[i].size(); j++){
                if (has[graph[i][j]]) pt_r++;
            }
            if (cnts[i] == pt_r){
                ans--;
            }
        }
        for (ll j = 0; j < graph[i].size(); j++){
            ll targ = graph[i][j];
            ll pt = 0;
            if (has[targ]) pt++;
            if (has[i]) pt++;
            if (cnts[targ] > 0 && cnts[targ] == pt){
                ans--;
            }
        }
        for (ll j = 0; j < graph[i].size(); j++){
            if (!has[graph[i][j]]) continue;
            ll adjs = adj_one[graph[i][j]];
            if (cnts[i] == 1) adjs--;
            ans -= adjs;
        }
        cout << ans << endl;
    }
}