<s>[INST] def calculate_intersections(tree_dict, routes):
    intersections = []
    for route in routes:
        route_intersections = []
        for node in route:
            if node in tree_dict:
                route_intersections.extend(tree_dict[node])
        intersections.append(route_intersections)
    return intersections

def find_common(route1, route2):
    return set(route1).intersection(set(route2))

def calculate_overlapping_load(tree_dict, route1, route2):
    intersections = find_common(route1, route2)
    overlapping_load = 0
    for node in intersections:
        overlapping_load += abs(tree_dict[node][0] - tree_dict[node][1])
    return overlapping_load[/INST]