#include <bits/stdc++.h>
#define re register
#define fst first
#define snd second
#define chmin(a,b) (a = min(a,b))
#define chmax(a,b) (a = max(a,b))

using namespace std;

const int N = 5e5 + 10,M = 24;
const int inf = 1e9 + 10;
int n,k,q,ans[N];
int L[N][M],R[N][M];
int tim,f[N],dfn[N];
vector<int> g[N];

struct Query{
    int l,id;
};
vector<Query> Q[N];

inline int read(){
    int r = 0,w = 1;
    char c = getchar();
    while (c < '0' || c > '9'){
        if (c == '-') w = -1;
        c = getchar();
    }
    while (c >= '0' && c <= '9'){
        r = (r << 3) + (r << 1) + (c ^ 48);
        c = getchar();
    }
    return r * w;
}

struct{
    struct node{
        int l,r;
        mutable int val;

        bool friend operator <(const node &a,const node &b){
            return a.l < b.l;
        }
    };
    set<node> st;

    inline void init(){
        st.clear(); st.insert({1,n,0});
    }

    inline auto split(int x){
        if (x > n) return st.end();
        auto it = prev(st.upper_bound({x,-1,-1}));
        int l = (it -> l),r = (it -> r),val = (it -> val);
        if (l == x) return it;
        st.erase(it); st.insert({l,x - 1,val});
        return st.insert({x,r,val}).fst;
    }

    inline void assign(int l,int r,int k){
        // cerr << l << " " << r << " assign\n";
        if (l <= 0 || r > n) return;
        auto itr = split(r + 1),itl = split(l);
        st.erase(itl,itr);
        st.insert({l,r,k});
    }

    inline int query(int k){
        int ans = 0;
        for (auto it = st.begin();it != st.end();it++){
            // cerr << (it -> l) << " " << (it -> r) << " " << pid[it -> l] << " " << pid[it -> r] << " " << (it -> val) << " ????\n";
            if ((it -> val) >= k) ans += ((it -> r) - (it -> l) + 1);
        }
        return ans;
    }
}T;

inline void bfs(int s){
    queue<int> q; q.push(s);
    while (!q.empty()){
        int u = q.front(); q.pop();
        dfn[u] = ++tim;
        for (int v:g[u]){
            if (!dfn[v]) q.push(v);
        }
    }
}

inline void dfs(int u,int fa){
    f[u] = fa;
    L[u][0] = R[u][0] = dfn[u];
    for (re int i = 1;i <= k;i++){
        L[u][i] = inf; R[u][i] = -inf;
    }
    for (int v:g[u]){
        if (v == fa) continue;
        dfs(v,u);
        for (re int i = 1;i <= k;i++){
            chmin(L[u][i],L[v][i - 1]);
            chmax(R[u][i],R[v][i - 1]);
        }
    }
}

inline void solve(){
    n = read(),k = read(),q = read();
    tim = 0; T.init();
    fill(dfn + 1,dfn + n + 1,0);
    for (re int i = 1;i <= n;i++){
        g[i].clear(); Q[i].clear();
    }
    for (re int i = 1,a,b;i < n;i++){
        a = read(),b = read();
        g[a].push_back(b); g[b].push_back(a);
    }
    for (re int i = 1,l,r;i <= q;i++){
        l = read(),r = read();
        Q[r].push_back({l,i});
    }
    bfs(1); dfs(1,0);
    // for (re int u = 1;u <= n;u++){
    //     cerr << u << " " << dfn[u] << " begin:\n";
    //     for (re int i = 0;i <= k;i++) cerr << i << " " << L[u][i] << " " << R[u][i] << " !!!\n";
    // }
    for (re int i = 1;i <= n;i++){
        for (re int u = i,tot = k;~tot && u;tot--,u = f[u]){
            int l = L[u][tot],r = R[u][tot];
            // cerr << l << " " << r << " " << tot << " sbsb\n";
            if (l <= r) T.assign(l,r,i);
            if (tot){
                l = L[u][tot - 1],r = R[u][tot - 1];
                if (l <= r) T.assign(l,r,i);
            }
        }
        for (Query p:Q[i]) ans[p.id] = T.query(p.l);
        // cerr << "===========\n";
    }
    for (re int i = 1;i <= q;i++) printf("%d\n",ans[i]);
}

int main(){
    int T; T = read();
    while (T--) solve();
    return 0;
}