#include <stdio.h>
#include <iostream>
#include <stdlib.h>
using namespace std;
#define MAX_MAN_NUM 100001 /* max human number + 1 */

typedef struct Tree* TreePointer;
struct Tree{
        int name;
        int level;
        TreePointer parent;
        TreePointer child;
};

/* allocation memory for array to 0~N-1 node treePointer */
TreePointer* NodeAdd =(TreePointer*)malloc(MAX_MAN_NUM * sizeof(TreePointer));
/* Initializing node address array list */
void Init_NodeAdd(){
        int i=0;
        while(NodeAdd[i]!=0){
                NodeAdd[i] = 0;
                i++;
        }
}

void FirstTree(){
        TreePointer temp = (Tree*)malloc(sizeof(Tree));
        temp->name = 0;
        temp->parent = 0;
        temp->level = 0;
        NodeAdd[0] = temp;
}

void Add(int n,int parent){
        TreePointer temp = (Tree*)malloc(sizeof(Tree));
        temp->name = n;
        temp->parent = NodeAdd[parent];
        temp->level =(*(NodeAdd[parent])).level + 1;
        NodeAdd[n] = temp;
}

void Free_Tree(){
        int i=0;
        while(NodeAdd[i] != 0){
                free(NodeAdd[i]);
                i++;
        }
}

int Find(int l, int r){
        int dist = 0;
        TreePointer left = NodeAdd[l];
        TreePointer right= NodeAdd[r];
        if(l==r){
                return 0;
        }
        int leftdist=0, rightdist=0;
        while(left->name != right->name){
                int diff = left->level - right->level;
                if(diff > 0){/* left->level > right->level */
                        leftdist++;
                        left = left->parent;
                }
                else if(diff < 0){/* left->level < right->level */
                        rightdist++;
                        right = right->parent;
                }
                else if(diff == 0){/* left->level == right->level */
                        leftdist++;
                        rightdist++;
                        left = left->parent;
                        right = right->parent;
                }
        }
        dist = leftdist + rightdist;
        return dist;
}
int main(){
        int cases;
        scanf("%d", &cases);
        while(cases--){
                Init_NodeAdd();
                int N, testN;
                scanf("%d", &N);
                //cout << N << endl;
                scanf("%d", &testN);
                //cout << testN << endl;
                NodeAdd[N] = 0;
                FirstTree(); N--;
                int parent = 0;
                int n = 1;
                while(N--){
                        scanf("%d",&parent);
                        //cout << parent << endl;
                        Add(n,parent);
                        n++;
                }
                int left, right;
                while(testN--){
                        scanf("%d",&left);
                        //cout << left << endl;
                        scanf("%d",&right);
                        //cout << right << endl;
                        printf("%d\n",Find(left,right));
                }

                Free_Tree();
        }

        free(NodeAdd);
}