import sys
from collections import deque

sys.setrecursionlimit(1 << 25)

def main():
    input = sys.stdin.read().split()
    ptr = 0
    N = int(input[ptr])
    ptr += 1
    Q = int(input[ptr])
    ptr += 1

    adj = [[] for _ in range(N+1)]
    for _ in range(N-1):
        a = int(input[ptr])
        ptr +=1
        b = int(input[ptr])
        ptr +=1
        adj[a].append(b)
        adj[b].append(a)

    LOG = 20
    parent = [[-1]*(N+1) for _ in range(LOG)]
    depth = [0]*(N+1)

    q = deque()
    root = 1
    q.append(root)
    parent[0][root] = -1
    depth[root] = 0
    visited = [False]*(N+1)
    visited[root] = True

    while q:
        u = q.popleft()
        for v in adj[u]:
            if not visited[v]:
                visited[v] = True
                parent[0][v] = u
                depth[v] = depth[u] + 1
                q.append(v)

    for k in range(1, LOG):
        for v in range(1, N+1):
            if parent[k-1][v] != -1:
                parent[k][v] = parent[k-1][parent[k-1][v]]
            else:
                parent[k][v] = -1

    def lca(u, v):
        if depth[u] < depth[v]:
            u, v = v, u
        for k in range(LOG-1, -1, -1):
            if depth[u] - (1<<k) >= depth[v]:
                u = parent[k][u]
        if u == v:
            return u
        for k in range(LOG-1, -1, -1):
            if parent[k][u] != -1 and parent[k][u] != parent[k][v]:
                u = parent[k][u]
                v = parent[k][v]
        return parent[0][u]

    for _ in range(Q):
        S = int(input[ptr])
        ptr +=1
        T = int(input[ptr])
        ptr +=1
        lca_node = lca(S, T)
        d = depth[S] + depth[T] - 2 * depth[lca_node]
        if d % 2 == 0:
            print(1)
        else:
            print(0)

if __name__ == '__main__':
    main()