#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 100005int T, n, ans;
int s[N][2], sum[2], last[2];
char c;int gcd(int a,int b) {return !b ? a : gcd(b, a % b);
}int main() {freopen("silly.in", "r", stdin);freopen("silly.out", "w", stdout);scanf("%d", &T);while (T--) {ans = sum[0] = sum[1] = last[0] = last[1] = 0;scanf("%d", &n);for (int i = 1; i <= n; i++) {scanf("%d %c", &s[i][1], &c);if (c == 'B') s[i][0] = 0, sum[0] += s[i][1];if (c == 'W') s[i][0] = 1, sum[1] += s[i][1];}if (!sum[0]) {printf("%d\n", sum[1]); continue;}if (!sum[1]) {printf("%d\n", sum[0]); continue;}int g = gcd(sum[0], sum[1]);sum[0] /= g; sum[1] /= g;for (int i = 1; i <= n; i++) {int now = s[i][0];if (!last[now ^ 1] || last[now ^ 1] % sum[now ^ 1]) {last[now] += s[i][1]; continue;}int need = last[now ^ 1] / sum[now ^ 1] * sum[now] - last[now];if (need < 0) last[now] += s[i][1];else if (s[i][1] < need) last[now] += s[i][1];else last[now] = s[i][1] - need, last[now ^ 1] = 0, ans++;}printf("%d\n", ans);}return 0;
}

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
#include <set>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 100005int n, l = 1, r = 0;
int a[N], b[N], pos[N], pre[N];
int f[N], q[N], p[N];
multiset<int> s;int main() {freopen("array.in", "r", stdin);freopen("array.out", "w", stdout);scanf("%d", &n);for (int i = 1; i <= n; i++) {scanf("%d%d", a + i, b + i);pre[i] = max(pre[i - 1], pos[a[i]] + 1);pos[a[i]] = i;}memset(f, 0x3f, sizeof f); f[0] = 0;for (int i = 1; i <= n; i++) {while (l <= r && p[l] < pre[i]) s.erase(q[l]), l++;while (l <= r && b[p[r]] < b[i]) s.erase(q[r]), r--;p[++r] = i; q[r] = f[p[r - 1]] + b[i]; s.insert(q[r]);s.erase(q[l]); s.insert(q[l] = f[pre[i] - 1] + b[p[l]]);f[i] = *s.begin();}printf("%d\n", f[n]);return 0;
}

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 100005int n;
int p[2 * N];int main() {freopen("linear.in", "r", stdin);freopen("linear.out", "w", stdout);scanf("%d", &n);for (int i = 1; i <= n; i++)scanf("%d%d", p + (i << 1) - 1, p + (i << 1));sort(p + 1, p + (n << 1) + 1);printf("%d %d\n", p[n], p[n + 1]);return 0;
}

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 302
#define M 50002
#define K 32int n, m, e, p, l, t, tot, ans = inf;
int to[(M << 1) * K], len[(M << 1) * K], nxt[(M << 1) * K], head[N * K];
int edge[M][3], f[N][N], dis[N * K], vis[N * K];void add(int u, int v, int w) {to[++tot] = v; len[tot] = w;nxt[tot] = head[u]; head[u] = tot;
}void spfa(int x, int y) {memset(dis, 0x3f, sizeof dis);memset(vis, 0, sizeof vis);queue<int> q;dis[x] = y; q.push(x);while (!q.empty()) {int now = q.front(); q.pop(); vis[now] = 0;for (int i = head[now]; i; i = nxt[i])if (dis[to[i]] > dis[now] + len[i]) {dis[to[i]] = dis[now] + len[i];if (!vis[to[i]]) {vis[to[i]] = 1; q.push(to[i]);}}}
}void floyd() {for (int k = 1; k <= n; k++)if (!(dis[k] - dis[k - 1]))for (int i = 1; i <= n; i++)for (int j = 1; j <= n; j++)if (i != j && i != k && j != k)f[i][j] = min(f[i][j], f[i][k] + f[k][j]);
}int main() {scanf("%d%d%d%d%d%d", &n, &m, &e, &p, &l, &t);memset(f, 0x3f, sizeof f);for (int i = 1; i <= e; i++) {int u, v, w;scanf("%d%d%d", &u, &v, &w);edge[i][0] = u; edge[i][1] = v; edge[i][2] = w;f[u][v] = f[v][u] = min(f[u][v], w);}for (int i = 1; i <= p; i++) {int u, v, w;scanf("%d%d%d", &u, &v, &w);add(v, u - 1, -w);}for (int i = 2; i <= n; i++)add(i, i - 1, 0), add(i - 1, i, 1);spfa(n, m); floyd();memset(head, 0, sizeof head); tot = 0;for (int i = 1; i <= e; i++)for (int k = 0; k <= t; k++) {add(k * n + edge[i][0], k * n + edge[i][1], edge[i][2]);add(k * n + edge[i][1], k * n + edge[i][0], edge[i][2]);}for (int i = 1; i <= n; i++)for (int j = 1; j <= n; j++)if (i != j && f[i][j] <= l)for (int k = 0; k < t; k++)add(k * n + i, (k + 1) * n + j, 0);spfa(1, 0);for (int k = 0; k <= t; k++)ans = min(ans, dis[k * n + n]);printf("%d\n", ans);return 0;
}