#define _CRT_SECURE_NO_WARNINGS

#include<stdio.h>

#include<queue>

#include<algorithm>

#include<iostream>

#include<vector>

#include<string.h>

#include<set>

#include<string>

using namespace std;

const int maxn = 3e4;;

int len1, len2, p[maxn], ans;

set<int> s;

struct edge {

    int to, from, w;

    edge(int to=, int from=, int w=) :to(to), from(from), w(w) {}

};

vector<edge> e;

bool cmp(edge a, edge b) {

    return a.w < b.w;

}

int f[maxn];

int find(int x) {

    return f[x] == x ? x : f[x] = find(f[x]);

}

void un(int x, int y) {

    int u = find(x), v= find(y);

    f[u] = v;

}

bool same(int x, int y) {

    return find(x) == find(y);

}

string map[];

int id[][];

int vis[][];

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

struct node {

    int x, y, t;

    node(int x=, int y=, int t = ) :x(x), y(y), t(t) {}

};

void bfs(int x, int y) {

    memset(vis, , sizeof(vis));

    queue<node> Q;

    Q.push(node(x, y, )); vis[x][y] = ;

    while (!Q.empty()) {

        node now = Q.front();

        Q.pop();

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

            int dx = now.x + dir[i][];

            int dy = now.y + dir[i][];

            if (map[dx][dy] == '#'||vis[dx][dy]) continue;

            if (map[dx][dy] == 'A')e.push_back(edge(id[x][y], id[dx][dy], now.t+));

            Q.push(node(dx, dy, now.t + ));

            vis[dx][dy] = ;

        }

    }

}

int main() {

    int t;

    cin >> t;

    while (t--) {

        int n, m;

        scanf("%d %d\n", &n,&m);

        for (int i = ; i < m; i++) {

            getline(cin, map[i]);

        }

        memset(id, , sizeof(id));

        e.clear();

        int idx = ;

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

            for (int j = ; j < n; j++) {

                if (map[i][j] == 'S')map[i][j] = 'A';

                if (map[i][j] == 'A' ) {

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

                }

            }

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

            for (int j = ; j < n; j++) {

                if(id[i][j])bfs(i, j);

            }

        for (int i = ; i < idx; i++) { f[i] = i; }

    sort(e.begin(), e.end(),cmp);

    int res = ;

    for (int i = ; i < e.size(); i++) {

        if (same(e[i].to, e[i].from)) continue;

        un(e[i].to, e[i].from);

        res += e[i].w;

    }

    cout << res << endl;

    }

    system("pause");

}