import sys
sys.setrecursionlimit(1 << 25)
input = sys.stdin.read().split()
idx = 0

def main():
    global idx
    N, Q = int(input[idx]), int(input[idx+1])
    idx +=2
    edges = [[] for _ in range(N+1)]
    for _ in range(N-1):
        a = int(input[idx])
        b = int(input[idx+1])
        idx +=2
        edges[a].append(b)
        edges[b].append(a)
    
    LOG = 20
    parent = [[-1]*(N+1) for _ in range(LOG)]
    depth = [0]*(N+1)
    visited = [False]*(N+1)
    
    from collections import deque
    q = deque()
    q.append(1)
    visited[1] = True
    parent[0][1] = -1
    while q:
        u = q.popleft()
        for v in edges[u]:
            if not visited[v] and v != parent[0][u]:
                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]]
    
    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[idx])
        T = int(input[idx+1])
        idx +=2
        L = lca(S, T)
        d = depth[S] + depth[T] - 2 * depth[L]
        if d % 2 == 0:
            print(1)
        else:
            print(0)
    
if __name__ == '__main__':
    main()