import sys
from collections import deque

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)

    # 预处理每个节点的深度奇偶性
    even = [0] * (n + 1)
    visited = [False] * (n + 1)
    queue = deque()
    queue.append(1)
    visited[1] = True
    even[1] = 0  # 深度为0，偶数

    while queue:
        u = queue.popleft()
        for v in adj[u]:
            if not visited[v]:
                visited[v] = True
                even[v] = (even[u] + 1) % 2
                queue.append(v)

    # 处理查询
    output = []
    for _ in range(q):
        s = int(input[ptr])
        ptr += 1
        t = int(input[ptr])
        ptr += 1
        if even[s] == even[t]:
            output.append("1")
        else:
            output.append("0")
    
    print('\n'.join(output))

if __name__ == "__main__":
    main()