Abstract We introduce a general two-colour interacting urn model on finite directed graph, where each at node reinforces all the urns in its out-neighbours according to fixed, non-negative, and balanced reinforcement matrix. show that fraction of balls either colour converges almost surely deterministic limit if is not Pólya type or graph such every vertex with non-zero in-degree can be reached...