#include<bits/stdc++.h>
#define endl '\n'
#define maxn 100010
using namespace std;

vector < int > adj[maxn];

bool visited[maxn];

int n;

int dfs(int actual , int destino , int dist)
{
    visited[actual] = true;

    int ret = 0;

    if(actual == destino)
    {
        return dist;
    }

    for(int i = 0; i < adj[actual].size(); i++)
    {
        if(!visited[adj[actual][i]])
        {
            ret = max(dfs(adj[actual][i] , destino , dist + 1) , ret);
        }
    }

    visited[actual] = false;

    return ret;
}

void clean()
{
    memset(visited , false , sizeof(visited));
}


int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    cout.precision(10);

    //freopen("in.txt" , "r" , stdin);

    int q , a , b , c , d;

    cin >> n >> q;

    while(--n)
    {
        cin >> a >> b;

        adj[a].emplace_back(b);
        adj[b].emplace_back(a);
    }

    while(q--)
    {
        cin >> a >> b >> c >> d;

        clean();

        int x = dfs(a , b , 0);

        clean();

        x += dfs(c , d , 0);

        clean();

        int sumy1 = dfs(a , c , 0);

        clean();

        sumy1 += dfs(b , d , 0);

        clean();

        int sumy2 = dfs(a , d , 0);

        clean();

        sumy2 += dfs(b , c , 0);

        int y = min(sumy1 , sumy2);

        if(y > x)
        {
            cout << 0 << endl;
        }
        else
        {
            cout << (x - y) / 2 + 1 << endl;
        }

    }

    return 0;
}