import sys
from collections import deque

def main():
    sys.setrecursionlimit(1 << 25)
    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)

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

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

    max_log = 20
    up = [[0]*(N+1) for _ in range(max_log)]
    up[0] = parent
    for k in range(1, max_log):
        for u in range(1, N+1):
            up[k][u] = up[k-1][up[k-1][u]]

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

    output = []
    for _ in range(Q):
        S = int(input[ptr])
        ptr +=1
        T = int(input[ptr])
        ptr +=1
        l = lca(S, T)
        d = depth[S] + depth[T] - 2 * depth[l]
        if d % 2 == 0:
            output.append('1')
        else:
            output.append('0')
    print('\n'.join(output))

if __name__ == '__main__':
    main()