#pragma region TEMPLATES

#include <bits/stdc++.h>
using namespace std;
typedef long long i64;

void init() {
#ifdef ONLINE_JUDGE
   cin.tie(0)->sync_with_stdio(0);
#else
   freopen( "in.txt", "r", stdin);
   freopen("out.txt", "w", stdout);
#endif
}

#ifdef ONLINE_JUDGE
    #define debug(...) 69420
    #define init_test(...) 69420
#else
void init_test(int t) {
    cerr << "\nTEST #" << t << "\n";
}
template<typename T>
T debug(T n) {
    cerr << n << " ";
    return n;
}
template<typename T, typename... Args>
T debug(T n, Args... args) {
    cerr << n << " ";
    debug(args...);
    return n;
}
void debug() {
    cerr << "\n";
}
#endif

void solve();
int main() {
    init();
    int t = 1;
    cin >> t;
    for (int i = 1; i <= t; ++i) {
        init_test(i);
        solve();
    }
}

#pragma endregion TEMPLATES

// Segment Tree
template<typename T>
class segment_tree {
private:
    int n;
    vector<T> Node;
    function<T(T, T)> merge;
    void _build(int node, int l, int r, const vector<T> &v) {
        if (l == r) {
            Node[node] = v[l];
            return ;
        }
        int mid = (l + r) / 2;
        _build(2 * node, l, mid, v);
        _build(2 * node + 1, mid + 1, r, v);
        Node[node] = merge(Node[2 * node], Node[2 * node + 1]);
    }
    T _query(int node, int l, int r, int x, int y) {
        if (x <= l && r <= y) {
            return Node[node];
        }
        
        int mid = (l + r) / 2;
        if (x <= mid && mid + 1 <= y) {
            return merge(_query(2 * node, l, mid, x, y),
                _query(2 * node + 1, mid + 1, r, x, y));
        }
        else if (x <= mid) {
            return _query(2 * node, l, mid, x, y);
        }
        else if (mid + 1 <= y) {
            return _query(2 * node + 1, mid + 1, r, x, y);
        }
        throw("ERROR - INVALID QUERY");
    }
    T _update(int node, int l, int r, int x, T val) {
        if (l == r) {
            return Node[node] = val;
        }

        int mid = (l + r) / 2;
        if (x <= mid) {
            return Node[node] = merge(
                _update(2 * node, l, mid, x, val),
                Node[2 * node + 1]);
        }
        else if (mid + 1 <= x) {
            return Node[node] = merge(
                Node[2 * node],
                _update(2 * node + 1, mid + 1, r, x, val));
        }
        throw("ERROR - INVALID UPDATE");
    }
public:
    segment_tree(int n, function<T(T, T)> merge) 
        : n(n), merge(merge) {
        Node.resize(1 << (int) ceil(log2(n) + 1));
    }
    segment_tree(int n, vector<T> v, function<T(T, T)> merge) 
        : segment_tree(n, merge) {
        _build(1, 1, n, v);
    }
    T query(int x, int y) {
        return _query(1, 1, n, x, y);
    }
    void update(int x, T val) {
        _update(1, 1, n, x, val);
    }
};

void solve() {
    int n;
    cin >> n;
    vector<vector<int> > G(n + 1);
    for (int i = 1; i < n; ++i) {
        int u_i, v_i;
        cin >> u_i >> v_i;
        G[u_i].push_back(v_i);
        G[v_i].push_back(u_i);
    }

    vector<pair<int, int> > h(n + 1);
    function<void(int, int)> dfs1 = [&] (int node, int prev) {
        for (const auto &it : G[node]) {
            if (it == prev) {
                continue;
            }
            dfs1(it, node);

            if (h[it].first + 1 >= h[node].first) {
                h[node].second = h[node].first;
                h[node].first = h[it].first + 1;
            }
            else if (h[it].first + 1 >= h[node].second) {
                h[node].second = h[it].first + 1;
            }
        }
    };
    dfs1(1, -1);

    int q;
    cin >> q;
    vector<vector<pair<int, int> > > Q(n + 1);
    for (int i = 1; i <= q; ++i) {
        int v_i, k_i;
        cin >> v_i >> k_i;
        Q[v_i].push_back({i, k_i});
    }

    vector<int> ans(q + 1);
    segment_tree<int> chain(n, [] (int a, int b) {
        return max(a, b);
    });
    int dep = 0;

    function<void(int, int)> dfs2 = [&] (int node, int prev) {
        ++dep;
        chain.update(dep, h[node].first - dep);

        for (const auto &it : Q[node]) {
            ans[it.first] =
                dep + chain.query(max(1, dep - it.second), dep);
        }

        for (const auto &it : G[node]) {
            if (it == prev) {
                continue;
            }
            if (h[it].first + 1 == h[node].first) {
                chain.update(dep, h[node].second - dep);
                dfs2(it, node);
                chain.update(dep, h[node].first - dep);
            }
            else {
                dfs2(it, node);
            }

        }
        --dep;
    };
    dfs2(1, -1);

    for (int i = 1; i <= q; ++i) {
        cout << ans[i] << " ";
    }
    cout << "\n";
}