#include <bits/stdc++.h>
#define _rep(i, x, y) for(int i = x; i <= y; ++i)
#define _req(i, x, y) for(int i = x; i >= y; --i)
#define _rev(i, u) for(int i = head[u]; i; i = e[i].nxt)
#define pb push_back
#define fi first
#define se second
#define mst(f, i) memset(f, i, sizeof f)
using namespace std;
#ifdef ONLINE_JUDGE
#define debug(...) 0
#else
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#endif
typedef long long ll;
typedef pair<int, int> PII;
namespace fastio{
    #ifdef ONLINE_JUDGE
    char ibuf[1 << 20],*p1 = ibuf, *p2 = ibuf;
    #define get() p1 == p2 && (p2 = (p1 = ibuf) + fread(ibuf, 1, 1 << 20, stdin), p1 == p2) ? EOF : *p1++
    #else
    #define get() getchar()
    #endif
    template<typename T> inline void read(T &t){
        T x = 0, f = 1;
        char c = getchar();
        while(!isdigit(c)){
            if(c == '-') f = -f;
            c = getchar();
        }
        while(isdigit(c)) x = x * 10 + c - '0', c = getchar();
        t = x * f;
    }
    template<typename T, typename ... Args> inline void read(T &t, Args&... args){
        read(t);
        read(args...);
    }
    template<typename T> void write(T t){
        if(t < 0) putchar('-'), t = -t;
        if(t >= 10) write(t / 10);
        putchar(t % 10 + '0');
    }
    template<typename T, typename ... Args> void write(T t, Args... args){
        write(t), putchar(' '), write(args...);
    }
    template<typename T> void writeln(T t){
        write(t);
        puts("");
    }
    template<typename T> void writes(T t){
        write(t), putchar(' ');
    }
    #undef get
};
using namespace fastio;
#define multitest() int T; read(T); _rep(tCase, 1, T)
namespace Calculation{
    const ll mod = 998244353;
    ll ksm(ll p, ll h){ll base = p % mod, res = 1; while(h){if(h & 1ll) res = res * base % mod; base = base * base % mod, h >>= 1ll;} return res;}
    void dec(ll &x, ll y){x = ((x - y) % mod + mod) % mod;}
    void add(ll &x, ll y){x = (x + y) % mod;}
    void mul(ll &x, ll y){x = x * y % mod;}
    ll sub(ll x, ll y){return ((x - y) % mod + mod) % mod;}
    ll pls(ll x, ll y){return ((x + y) % mod + mod) % mod;}
    ll mult(ll x, ll y){return x * y % mod;}
}
using namespace Calculation;
const int N = 5e5 + 5;
ll n, m, a[N], sum[N];
PII e[N];
multiset<PII> st[N];
void merge(int x, int y){//y-->x
    if(st[y].size() > st[x].size()) swap(st[x], st[y]);
    for(auto &i : st[y]) st[x].insert(i); st[y].clear();
}
int main(){
    multitest(){
        read(n, m);
        ll ans = 0;
        set<int> pos;
        _rep(i, 1, n) pos.insert(i);
        _rep(i, 1, m){
            read(e[i].fi, e[i].se);
            e[i].fi++, e[i].se++;
            if(e[i].fi == e[i].se) sum[e[i].fi] += 1ll * i * i, ans += 1ll * i * i;
            else st[e[i].se].insert(make_pair(e[i].fi, i));
        }
        writes(ans);
        _rep(i, 1, n){
            ll x; read(x), x = (x + ans) % n + 1;
            ans -= sum[x];
            auto it = pos.lower_bound(x);
            if(it != pos.begin()){
                int y = *prev(it);
                merge(y, x);
                int t = (prev(it) == pos.begin()) ? 1 : *prev(prev(it)) + 1;
                while(st[y].size() && (*prev(st[y].end())).fi >= t){
                    ll id = (*prev(st[y].end())).se;
                    sum[y] += id * id, ans += id * id;
                    st[y].erase(prev(st[y].end()));
                }
            }
            if(next(it) != pos.end()){
                int y = *next(it);
                int t = (it == pos.begin()) ? 1 : *prev(it) + 1;
                while(st[y].size() && (*prev(st[y].end())).fi >= t){
                    ll id = (*prev(st[y].end())).se;
                    sum[y] += id * id, ans += id * id;
                    st[y].erase(prev(st[y].end()));
                }
            }
            pos.erase(x);
            writes(ans);
        }
        puts("");
        _rep(i, 1, n) st[i].clear(), sum[i] = 0;
    }    
    return 0;
}