Given two tridiagonal hermitian matrices A,B with $a_i\in \mathbb{R}$ and $b_i\in \mathbb{C}$ as follows \begin{align} A= \begin{pmatrix} a_{1} & |b_1| & \cdots & 0 \\ |b_1| & a_{2} & \cdots & 0 \\ \vdots & \ddots & \ddots & |b_{n-1}| \\ 0 & 0 & |b_{n-1}| & a_{n} \end{pmatrix} \end{align} and \begin{align} B= \begin{pmatrix} a_{1} & b_1 & \cdots & 0 \\ \overline{b_1} & a_{2} & \cdots & 0 \\ \vdots & \ddots & \ddots & b_{n-1} \\ 0 & 0 & \overline{b_{n-1}} & a_{n} \end{pmatrix} \end{align}
is there any way to find the eigenvectors of B in case I already know the eigenvectors of A? It is relatively easy (if one knows the proper recursion) to see that the eigenvalues of A and B are all the same, but I have a hard time to find the eigenvectors of B by knowing those of A... All suggestions are warmly appreciated.
bests
EDIT: I tried some examples with mathematica, but to be honest, I couldn't find any consistent pattern which I could generalize. I tried to compute it directly by solving $ker(B-\lambda I)$ but I couldn't make use of knowing the eigenvectors of A. Maybe something is possible using the spectral theorem, the basis transformation S for A is known, so... $A=S*D*S^h$ and $B=U*D*U^h$ but how to find U...I am stuck at the moment