//author : Avishkar A. Hande
#include
#define ll long long
using namespace std;

const int maxS = 1e5+10;
vector adj[maxS];

ll LOG;
int timer;
vector tin, tout;
vector up;

/*
    Binary Lifting is mostly used to find Lowest Common Ancestor
    as it reduces the time complexity to log(n);
*/

void dfs(int v, int p)
{
    tin[v] = ++timer;
    up[v][0] = p;
    for (int i = 1; i = 0; --i) {
        if (!is_ancestor(up[u][i], v))
            u = up[u][i];
    }
    return up[u][0];
}

void preprocess(int root, int n) {
    tin.resize(n);
    tout.resize(n);
    timer = 0;
    LOG = ceil(log2(n)) + 1;
    up.assign(n+1, vector(LOG + 1));
    dfs(root, root);
}

int main()
{
	ll node, queries;
	cin >> node >> queries;
	for(int i = 0; i < node-1; i++){
		ll u, v;
		cin >> u >> v;
		adj[u].push_back(v);
		adj[v].push_back(u);
	}
    preprocess(1, node);
    while(queries--){
        ll a, b;
        cin >> a >> b;
        cout