$\kappa$ is preserved, and moreover all reals are added by the small generics.
Let $(P_0,p_0)$ be a condition and let $\sigma$ be a name for a real. First, enumerate the elements of $P_0$ below $p_0$ as $\langle p_i : 0<i< \lambda \rangle$. Let $(Q_1,q_1) \leq (P_0,p_1)$ decide $\sigma(0)$. Then let $(Q_2,q_2) \leq (Q_1,p_2)$ also decide $\sigma(0)$. Note that we are enlarging the partial order but going below $p_2$ instead of $q_1$. This makes sense because $P_0 \lhd Q_1$. Consider what happens at stage $\omega$. We have an increasing sequence of posets $P_0 \lhd Q_1 \lhd Q_2 \lhd \dots$. If we let $Q_\omega$ be the union, then this is a regular superorder of each $Q_n$, since this is expressible as the first-order property, for all $q \in Q_\omega$ (which is in some $Q_m$ for $m \geq n$), there is $r \in Q_n$ such that all $s \leq r$ are compatible with $q$.
So we continue transfinitely until we reach a poset $Q_\lambda$ that is a regular superorder of $P_0$ and each $Q_i$, $0<i<\lambda$. It has the property that for all $p \in P_0$ below $p_0$, there is $r \in Q_\lambda$ below $p$ such that $(Q_\lambda,r)$ decides $\sigma(0)$. Now repeat process $\omega$-times until we reach some poset $R_1$ such that for all $p \in P_0$ below $p_0$ and all $n<\omega$, there is $r \leq p$ in $R_1$ such that $(R_1,r)$ decides $\sigma(n)$.
Next, repeat this whole process with respect to $R_1$ and iterate, reaching a closure point $R_\omega \in V_\kappa$. We will have that for all $r \in R_\omega$ below $p_0$, and all $n<\omega$, there is $r' \leq r$ in $R_\omega$ such that $(R_\omega,r')$ decides $\sigma(n)$. In other words, for each $n$, the set of $r \in R_\omega$ such that $(R_\omega,r)$ decides $\sigma(n)$ is dense below $p_0$ in $R_\omega$.
Now let us explain the claim in the OP that the generic for $\mathbb A$ adds a generic $G_P$ for all posets $P$ appearing in $G$. Fix $(P,p) \in \mathbb A$, and suppose $D$ is a dense subset of $P$. For any $(Q,q) \leq (P,p)$ there is $q' \leq q$ in $Q$ such that $q' \leq d$ for some $d \in D$, since $D$ is predense in $Q$. Thus $(P,1)$ forces that the set $G_P := \{ p \in P : (P,p) \in G \}$ is generic.
So if we force below $(R_\omega,p_0)$, then for each $n \in \omega$, the generic $G$ will have some element of the form $(R_\omega,r)$ deciding $\sigma(n)$. This means that $\sigma^G$ will be an element of $V[G_{R_\omega}]$. By the arbitrariness of $(P_0,p_0)$ and $\sigma$, the desired conclusion follows.