#include <stdio.h>

 #include <string.h>

 const int N=;

 int pos[N][N],map[N][N];

 int link[N];

 bool vis[N];

 int dir[][] = {{,-},{,},{,},{-,}};

 int n;

 int dfs(int x)

 {

     for (int i = ; i <= n; i++)

     {

         if (map[x][i]&&!vis[i])

         {

             vis[i] = true;

             if(!link[i]||dfs(link[i]))

             {

                 link[i] = x;

                 return ;

             }

         }

     }

     return ;

 }

 int main()

 {

     char ch;

     int t,h,w;

     scanf("%d",&t);

     while(t--)

     {

         int id = ;

         int ans = ;

         scanf("%d%d%*c",&h,&w);

         memset(pos,,sizeof(pos));

         memset(map,,sizeof(map));

         memset(link,,sizeof(link));

         for(int i = ; i <= h; i++)

         {

             for (int j = ; j <= w; j++)

             {

                 scanf("%c",&ch);

                 if (ch=='*')

                     pos[i][j] = ++id;

             }

             getchar();

         }

         for (int i = ; i <= h; i++)

         {

             for (int j = ; j <= w; j++)

             {

                 if(pos[i][j])

                     for (int k = ; k < ; k++)

                     {

                         int dx = i+dir[k][];

                         int dy = j+dir[k][];

                         if(pos[dx][dy])

                         {

                             map[pos[i][j]][pos[dx][dy]] = ;

                         }

                     }

             }

         }

         n = id;

         for (int i = ; i <= n; i++)

         {

             memset(vis,,sizeof(vis));

             if(dfs(i))

                 ans++;

         }

         printf("%d\n",n-ans/);//无向二分图的最小路径覆盖 = 顶点数 – 最大二分匹配数/2

     }

     return ;

 }