#include <cstdio>
#include <algorithm>
#include <utility>
#include <array>
#include <vector>
using namespace std;
typedef pair<int, int> pii;
constexpr int MAXN = 5e4 + 5;
constexpr int LOGMAXN = 17;

vector<int> g[MAXN];
int lift[MAXN][LOGMAXN];
int tin[MAXN], tout[MAXN], timer;
pii be1, be2;

bool visited[MAXN];
void dfs(const int n, const int p)
{
	lift[n][0] = p;
	for (int i = 1; i < LOGMAXN; i++)
		lift[n][i] = lift[lift[n][i - 1]][i - 1];
	visited[n] = true;
	tin[n] = timer++;
	for (const int a : g[n])
	{
		if (a == p)
			continue;
		if (!visited[a])
			dfs(a, n);
		else
		{
			be1 = {a, n};
			swap(be1, be2);
		}
	}
	tout[n] = timer++;
}

bool is_ancestor(const int u, const int v) { return tin[u] <= tin[v] && tout[u] >= tout[v]; }

struct Path
{
	const int top, bot;
	constexpr static Path nullpath() { return {-1, -1}; }
	bool isnull() const { return top == -1 && bot == -1; }
	bool intersect(const Path &o) const
	{
		return is_ancestor(top, o.top) && is_ancestor(o.top, bot) ||
		       is_ancestor(top, o.bot) && is_ancestor(o.bot, bot) ||
		       is_ancestor(o.top, top) && is_ancestor(top, o.bot) ||
		       is_ancestor(o.top, bot) && is_ancestor(bot, o.bot);
	}
};

array<Path, 2> get_paths(int u, int v)
{
	if (is_ancestor(u, v))
		return {Path{u, v}, Path::nullpath()};
	if (is_ancestor(v, u))
		return {Path{v, u}, Path::nullpath()};
	const int start_u = u;
	for (int i = LOGMAXN - 1; i >= 0; i--)
		if (!is_ancestor(lift[u][i], v))
			u = lift[u][i];
	return {Path{u, start_u}, Path{lift[u][0], v}};
}

bool check(const initializer_list<pii> n)
{
	vector<Path> paths;
	for (const pii a : n)
	{
		const auto [p1, p2] = get_paths(a.first, a.second);
		paths.push_back(p1);
		if (!p2.isnull())
			paths.push_back(p2);
	}
	for (int i = 0; i < paths.size(); i++)
		for (int j = 0; j < i; j++)
			if (paths[i].intersect(paths[j]))
				return false;
	return true;
}

int main()
{
	int N, Q;
	scanf("%d %d", &N, &Q);
	for (int i = 0, u, v; i < N + 1; i++)
	{
		scanf("%d %d", &u, &v);
		g[u].push_back(v);
		g[v].push_back(u);
	}

	timer = 0;
	dfs(1, 1);
	for (int q = 0, u, v; q < Q; q++)
	{
		scanf("%d %d", &u, &v);
		int ans = 1;
		ans +=
		    check({pii(u, be1.first), pii(be1.second, v)}) ||
		    check({pii(u, be1.second), pii(be1.first, v)});
		ans +=
		    check({pii(u, be2.first), pii(be2.second, v)}) ||
		    check({pii(u, be2.second), pii(be2.first, v)});
		ans +=
		    check({pii(u, be1.first), pii(be1.second, be2.first), pii(be2.second, v)}) ||
		    check({pii(u, be1.first), pii(be1.second, be2.second), pii(be2.first, v)}) ||
		    check({pii(u, be1.second), pii(be1.first, be2.first), pii(be2.second, v)}) ||
		    check({pii(u, be1.second), pii(be1.first, be2.second), pii(be2.first, v)}) ||
		    check({pii(u, be2.first), pii(be2.second, be1.first), pii(be1.second, v)}) ||
		    check({pii(u, be2.first), pii(be2.second, be1.second), pii(be1.first, v)}) ||
		    check({pii(u, be2.second), pii(be2.first, be1.first), pii(be1.second, v)}) ||
		    check({pii(u, be2.second), pii(be2.first, be1.second), pii(be1.first, v)});
		printf("%d\n", ans);
	}
	return 0;
}