1900分图论：Two Fairs 寻找点对（x,y）必经a，b的个数

1.求必经a的点，可以在dfs时先将a点标记，然后从b点出发，最后不能到达的点，必经a的点

2.b点同理

3.乘法原理

//#define LOCAL
#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define mem(a, b) memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
#define DNF 0x7f
#define DBG printf("this is a input\n")
#define fi first
#define se second
#define mk(a, b) make_pair(a,b)
#define pb push_back
#define p_queue priority_queue
#define CLOSE ios::sync_with_stdio(0); cin.tie(0)

void FileIO()
{
#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("odata.out", "w", stdout);
#endif
}
ll gcd(ll a, ll b) {
    return b == 0 ? a : gcd(b, a % b);
}

ll lcm(ll a, ll b) {
    return a / gcd(a, b) * b;
}
const int N = 200005;
int T;
int n , m , st, ed;
vector <int> edge[N];
int vis[N];
ll cnt1 = 0 , cnt2 = 0;
void bfs1()
{
    queue <int> q;
    vis[ed] = 1;
    vis[st] = 1;
    q.push(st);
    while(!q.empty())
    {
        int no = q.front();
        q.pop();
        for (auto v : edge[no])
        {
            if(!vis[v])
            {
                vis[v] = 1;
                q.push(v);
            }
        }
    }
    for (int i = 1 ; i <= n ; i ++)
        if(!vis[i])
            cnt1 ++;

}
void bfs2()
{
    queue <int> q;
    vis[st] = 1;
    vis[ed] = 1;
    q.push(ed);
    while(!q.empty())
    {
        int no = q.front();
        q.pop();
        for (auto v : edge[no])
        {
            if(!vis[v])
            {
                vis[v] = 1;
                q.push(v);
            }
        }
    }
    for (int i = 1 ; i <= n ; i ++)
        if(!vis[i])
            cnt2 ++;

}

int main(void)
{
    CLOSE;
    cin >> T;
    while (T --)
    {
        cnt1 = cnt2 = 0;
        cin >> n >> m >> st >> ed;
        for (int i = 1 ; i <= m ; i ++)
        {
            int u , v;
            cin >> u >> v;
            edge[u].pb(v);
            edge[v].pb(u);
        }
        mem(vis,0);
        bfs1();
        mem(vis,0);
        bfs2();
        cout << 1ll * cnt1 * cnt2 << endl;
        for (int i = 1 ; i <= n ; i ++)
            edge[i].clear();
    }

}